Scribd
Upload
4 views1 page

Module 5

Module 5 notes

Uploaded by

hemalathanl24
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views1 page

Module 5

Module 5 notes

Uploaded by

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

STSKK’s

TONTADARYA COLLEGE OF ENGINEERING


Mundaragi Road, GADAG-582101.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
MODULE –V:
IMPORTANT QUESTIONS
1. What is hashing? Differentiate between Static Hasing and Dynamic Hashing.
2. Explain various hashing functions with an example for each.
3. Briefly explain Dynamic Hashing Using Directories.
4. Briefly explain Directoryless Dynamic Hashing.
5. Explaing Single and Double Ended Priority Queues.
6. Explain leftist trees with an examples.
i. Height Based Leftist Trees (HBLT)
ii. Weight Based Leftist Trees (WBLT)
7. Briefly Explain Optimal Search Binary Trees.

***Write below mentioned question no. in your assignment booklet from


module V ***
1,2,3,4,5,6,7

~~*~~

Data Structures and Applications (BCS304)

You might also like