Ict - 1
Uploaded by
Sumathi CSE JITIct - 1
Uploaded by
Sumathi CSE JITJAYALAKSHMI INSTITUTE OF TECHNOLOGY
OFFICE OF THE CONTROLLER OF EXAMINATIONS
ICT- I
Year/Sem: II/ III Max.Marks:100
Branch: CSE Duration: 3 hrs
Name of the Subject: CS3301 DATA STRUCTURES Date: 7.12.2023
C1&2: Introduction & Learn the basics of vector representation. K 1- Remember K2-
Understand K3- Apply, K4- Analysis K5- Evaluate K6- Create
PART-A (10*2=20)
1. What is tree?
2. Define a binary tree?.(CO1,K1)
3. What is expression tree?.(CO1,K2)
4. How do you calculate the depth of a B- tree?( CO2,K2)
4. What you mean by level of the tree?
5. List the application of tree? (CO2,K1)
7. Define balance factor of AVL tree?(CO2,K2)
8. List out the tree traversal ?.(CO1,K2)
9. List the different types of binary tree? (CO2,K1)
10. show the result of inserting 3,1,4,6,9,2,5,7 into an initially empty binary sreach tree?
PART-B (5*13=65)
6. A)Write the following routines to implement the basic binary search tree operations
(i)Perform search operation in binary in binary Search Tree.(ii)find min and find
maximum? .(CO1,K1)
(OR)
B) Write a routine for AVL tree insertion.Insert the following elements in the empty
tree and how do you balance the tree after each element insertion Elements
2,5,4,6,7,9,8,3,1,10. (CO1,K3)
12. A) Briefly about B+ tree .and discuss the application on heap?
(CO1,K1)
(OR)
B) Write a routine for post order traversal.ic it possible to find minimum and
maximum value in the binary search tree using traversal?
(i)discuss Display the given tree (figure ) using inorder ,preorder and postorder
traversal
(ii)Delete 11 and 10 from the above binary search tree.and display the tree after each
deletion
B) Expalin the tree traversal techniques with example? (CO2,K3)
14. A)How to insert and delete an element into binary search tree and write down the
code for the insertion routine with an example?(CO1,K1 )
(OR)
B)writing an algorithm for inserting and deleting a node in a binary search tree.?
(CO2,K3)
15.A) Discuss the different traversal technique in a binary tree with suitable algorithm
and example?(CO2,K2)
(OR)
B)Explain the construction of expression tree with examples. Give the applications of
trees?.
PART-C(1*15=15)
16.A) Explain and and detail about tree ADT ?and suitable programe ? (CO2,K4)
(OR)
B) Explain the following operation on a binary search tree with suitable algorithms?
(CO1,K2)
(i)Find a node.
(ii)Find a minimum and maximum elements of binary search tree.