Answer
ALL Questions (III and IV Units)
PART
A – (15x 2 = 10 Marks)
1.
Define
AVL tree
2.
What
is sorting
3.
Diferentiate
B-tree and Binary search tree
4.
What
is Hashing
5.
Define
Multiple Hashing
Answer all questions
6.
Explain AVL tree with Operation 14
7.
Explain B-tree
with Operation 13
8.
Briefly explain
Quick sort with example 13
0 Comments