Scribd
Upload
58 views2 pages

Unit-I - ADS - IMP QP

Ads important questions

Uploaded by

varuntejasingampalli2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
58 views2 pages

Unit-I - ADS - IMP QP

Ads important questions

Uploaded by

varuntejasingampalli2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

II B.

Tech I Sem ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS

UNIT-I

Important Question Bnak

Short Questions:
1. Define Algorithm analysis.
2. Define time Complexity analysis.
3. Define space complexity analysis
4. List out different Asymptotic notations.
5. Write applications of AVL trees.
6. Write applications of B-Trees.
7. How do you analyze the performance of an algorithm?
8. What is LR rotation.
9. What is RL rotations.
10. Difference between AVL tree and B tree.
11. What are the properties of B-tree.
12. What happened If the target key is at internal node in B-tree.

Essay Questions:
1. Explain in detail about Asymptotic notations with examples.
2. What is an AVL tree? How do we define the height of it? Explain balance factor associated with a node
of an AVL tree.
3. Construct an AVL Tree for the list 21,26,30,9,4,14,28,18,15,10,2,3,7 by using successive insertion.
Illustrate the steps clearly.
4. What do you mean by a balance factor in AVL tree and explain about LL & RR rotations with an
example.
5. Delete form AVL tree the following nodes in sequence 2,3,10,18,4,9,14,7,15

6. Write the Algorithm for AVL insertion operations.


7. What is a B-tree? Specify its properties and describe the construction of a B-Tree for the following
elements 5, 2, 13, 3, 45, 72, 4, 6, 9, 22
8. Construct B-tree of order 4 for the following elements.5,3,21,9,1,13,2,7,10,12,4

Page | 1
II B.Tech I Sem ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS

9. Delete elements 5400,4200,5100,4400,6500,4300 from the following B Tree. (M=6)

10. What are the advantages and Disadvantages of AVL tree and B B-tree.
11. What are the different types of imbalances that occur while deleting a node from AVL trees?
12. What are the differentnt types of Cases that occur while deleting a node from B--tree trees?
13. Create a 2-33 tree from the following list of data items: 5,6,8,21,12,30,34,27,23,4,33,7,24,9,10,11,13,38.
14. Write algorithm for B-tree
tree insertion operation with example
15. Write algorithm for B-tree deletion operation with example
16. Delete elements 14,3,13,5 from the following B Tree. ((Order=3)

Page | 2

You might also like