Jyothy Charitable Trust®
Jyothy Institute of Technology
Tataguni, off Kanakapura road, Bengaluru-560082
Approved by The All India Council for Technical Education (AICTE) - New Delhi;
Affiliated to VisvesvarayaTechnological University(VTU), Belagavi;
Department of Computer Science & Engineering
Accredited by National Board of Accreditation (NBA) -New Delhi.
EXHAUSTIVE QUESTION BANK
Batch 2022 - 2026
Year/Semester/Section 2nd/3rd/B
BCS304 – Data Structures andApplications
Course Code -Title
Module No. -Title 5-Hashing,Priority Queues, Efficient Binary
Search Tree.
Name of the Course Asst.Prof.
Mrs. Prathibha KN Designation
In charge
QNo. Questions COs RBT
1 Consider the following 4 digit employee number 9614, 5882, 6713, CO4 L1
4409,
and 1825. Find 2 digit hash address of each number using
a) Division method With 97
b) Mid-square method.
c) The folding method without reversing
d) The folding method with reversing
2 Explain in detail about static and dynamic hashing. CO4 L3
3 Explain hashing and collision. Explain the methods to resolve the CO4 L1
collision
4 Define Hashing. Discuss the following Hash Functions with proper CO4 L3
examples: a) Division b) Midsquare c) Folding
5 Consider the hash table of size 10. Using Linear probing, insert the keys CO4 L2
72, 27, 36, 24, 63, 81, 92 & 101.
6 Apply Dynamic Hashing technique and insert the following keys: CO4 L2
17, 5, 6, 22, 24, 11, 30, 7, 10, 21, 27
7 Explain different types of Priority queues with an example? CO4 L3
8 What is a Leftist Tree? Explain its types with an example each. CO4 L3
9. Explain Merge Operation of Leftist Tree with an example. CO4 L2
10. What is an optimal Binary Search Tree? Explain with an example ? CO4 L2
11. Find the expected cost (Average number of comparisons)for the CO4 L1
following trees with probabilities given in the table:
13 CO4 L3
Course In charge DAEC HOD
