Syllabuses
Attempt any two of the following: a. Common operations on data structures b. Tournament tree c. Direct file organization
Attempt any two of the following:
a. Common operations on data structures
b. Tournament tree
c. Direct file organization
Explain Determining the rank of element in detail.
Explain Determining the rank of element in detail.
Discuss and explain how to augment a Data Structure.
Discuss and explain how to augment a Data Structure.
Write the algorithm of insertion sort and find its time complexity.
Write the algorithm of insertion sort and find its time complexity.
Which is min heap for the given data 15 6 15 50 3 33 45 40 80 10
Which is min heap for the given data
15 6 15 50 3 33 45 40 80 10
Sort the following number using selection sort and give the required steps. 31 27 42 34 76 61 10 4
Sort the following number using selection sort and give the required steps.
31 27 42 34 76 61 10 4
Explain AVL tree. Insert the following elements in AVL tree: 50 25 10 5 7 3 30 20 8 15. What are Red Black trees? Discuss the properties of Red Black trees in detail.
Explain AVL tree. Insert the following elements in AVL tree: 50 25 10 5 7 3 30 20 8 15. What are Red Black trees? Discuss the properties of Red Black trees in detail.
Discuss briefly the various asymptotic notations used in algorithm analysis.
Discuss briefly the various asymptotic notations used in algorithm analysis.