Scribd
Upload
4 views

FS 3rd Assignment

The document contains a series of questions related to data structures, specifically focusing on AVL trees, Paged Binary trees, B-trees, hashing techniques, and collision resolution methods. It discusses the differences between tree structures, the implications of block splitting and merging, and various hashing functions and their collision resolution strategies. Additionally, it touches on the internal structures of index sets and methods to avoid collisions in hashing.

Uploaded by

Sai karthik P K
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

FS 3rd Assignment

The document contains a series of questions related to data structures, specifically focusing on AVL trees, Paged Binary trees, B-trees, hashing techniques, and collision resolution methods. It discusses the differences between tree structures, the implications of block splitting and merging, and various hashing functions and their collision resolution strategies. Additionally, it touches on the internal structures of index sets and methods to avoid collisions in hashing.

Uploaded by

Sai karthik P K
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

Q1) a. what is AVL tree?

Explain with an example how it is differ from completely balanced


tree?
b. discuss about Paged Binary tree with its problems?
Q 2) Explain the block splitting and merging due to insertion and deletion in the sequence
set with example?
Q3) Explain simple prefix B-tree? Discuss simple prefix B+ tree and its maintenance.
Maintenance:-
Q4) Discuss the reasons for using common block size for index and sequence set? Explain
the internal structure of index set blocks

Internal Structure of index set blocks:-


Q5) Compare the strength and weakness of B+ tree and B- tree and simple prefix B+tree
Q6) What is Hashing? Explain the different Hashing functions with an example.
Hashing Functions:-
Q7) what is collision? Explain Collision resolution by progressive overflow.
Q8) What is hashing? Explain simple hashing algorithm and explain with an example
Q 9) Discuss any three methods used to avoid collision in hashing technique.
Q10) Explain the double hashing and chained progressive overflow collision resolution
techniques.
Q11) Explain the working of extendible hashing
Q12) Write short notes on
i) Dynamic hashing
ii) Linear hashing

iii) buddy buckets

You might also like