Scribd
Upload
8 views2 pages

Module 5 - Assignment Questions

Uploaded by

clgsiri
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
8 views2 pages

Module 5 - Assignment Questions

Uploaded by

clgsiri
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/ 2

Department of Artificial Intelligence & Data Science

Module V Important questions

Sem/Sec: III Subject: Data Structure Subject Code:BCS304

S.no Questions BL CO

1 What is dynamic hashing? Explain the following techniques with L1 5


examples: i) Dynamic hashing using directories ii) Directory less
dynamic hashing
2 Define the leftist tree. Give its declaration in C. Check whether the L1 5
given binary tree is a leftist tree or not. Explain your answer.

3 What is Collision?What are the methods to resolve Collision and Explain L2 5


in detail with example
4 Define hashing. Explain different hashing functions with examples. L1 5
Discuss the properties of a good hash function
5 What is a Priority queue? Demonstrate functions in C to implement the L1 5
Max Priority queue with an example. i) Insert into the Max priority
queue ii) Delete into the Max priority queue iii) Display Max priority
queue
6 Explain Optimal Binary search tree in details. L2 5

You might also like