Jyothy Charitable Trust®
Jyothy Institute of Technology
Tataguni, off Kanakapura road, Bengaluru-560082
Approved by The All India Council for Technical Education (AICTE) - New Delhi;
Affiliated to VisvesvarayaTechnological University(VTU), Belagavi;
Department of Information Science & Engineering
Accredited by National Board of Accreditation (NBA) -New Delhi.
ASSIGNMENT QUESTIONS
3rd SEMESTER
Semester 3rd Sem
Course Data Structures and Applications
Subject Code BCS304
Name of the Course
Ms. Shilpa Narayan Designation Assistant. Prof.
In charge
Assignment No: 02 Total marks:10
Date of Issue : 05th Dec 2024 Date of Submission : 11th Dec 2024
Note: All Questions Compulsory
Course RBT
Sl. No Assignment Questions Marks
Outcome Level
Define Binary tree. Explain the representation of a binary tree with a
1. CO4 L2 2
suitable example.
Define the Threaded binary tree. Construct Threaded binary for the
2. CO4 L3 2
following elements: A, B, C, D, E, F, G, H, I
Define selection tree. Construct min winner tree for the runs of a game
given below. Each run consists of values of players. Find the first 5
winners.
3.
R1 R2 R3 R4 R5 R6 R7 R8 CO4 L3
2
10 9 20 6 8 9 90 17
15 20 20 15 15 11 95 18
16 38 30 25. 50 16 99 20
Define the Disjoint set. Consider the tree created by the weighted CO4 L2 2
union function on the sequence of unions: union(0,1), union(2,3),
4. union(4,5), union(6,7), union(0,2), union(4,6), and union(0,4).
Process the simple find and collapsing find on eight finds and
compare which find is efficient.
Define Binary Search tree. Construct a binary search tree (BST) for CO4 L3 2
the following elements: 100, 85, 45, 55, 120, 20, 70, 90, 115, 65, 130,
5.
145. Traverse using in-order, pre-order, and post-order traversal
techniques. Write recursive C functions for the same.
Course In charge DAEC HOD
