Dr. D.Y.

Patil Unitech Society's

DPU pr. D.Y. Patil Institnte of TechnoloY
Pimpri, Pune - 411018.

-Dr.D.Y. Patil Institute fTechnology, Pimpri, Pune-411018

Department of Al & DS
Semester &Year Sem 1l& Unit Test 1-Question Paper - SET C1
2022-2023 Class: SE C
Date:: 29/03/2023
210252:Data Structures and MEximum Marks: 30
Algonuinu
ONo CO PO
Q1
1,2,3,4 1,2,3
02 1,2,3.4 1,2,3
a3 2 1,2 1,2,3
Q4 1,2 3
Instruction: (i) Neat Diagrams must be drawn
wherever
necessary (i) Assume suitable data wherever necessary
01a) What is Hash function? What are the different characteristics of good hash (5)
function? Explain six different types of hash functions.
Q1b) Explain search operation for skip list (5)
Q1c) Explain following Collision Resolution Strategies: (5)
Linear Probing 2. Quadratic Probing

Q2a).
(OR)
For the given set of values35 36,25,41 2501,129,65,29,16,4.99. Create the (5)
hash table with size 20 and resolve collision using open' addréssingtechniques
Q2b). Explain following Collision Resolution Strategies: (5)
Double Hashing 2. Rehashing
Q2c). For the given set of values. 11, 33, 20, 88, 79, 98, 44, 68, 66, 22 Create a hash (5)
table with size 10 and resolve collision using chaining with replacement and
without replacement. Use the modulus Hash function. (key % size.)
3a) Write a non-recursive pseudo code for post order traversing of binary tree (5)
03 b) Write a non-recursive pseudo code for pbst order traversing of binary tree. (5)
Q3 c) Convert below tree into binary tree: (5)

(OR)
Q4 a) For given set of values: (5)
Node -weight A=10,B-3,C-4D=15,E-2,F=4,0-2,H=3
Construct the huffman's coding
Q4 b) Find the inorder post-order & pre-orderfor the following Tree (5
)
,

04 c) Write ct+ code for Binary operation: (5)

Create 2. Insert 3. Delete