Scribd
Upload
28 views1 page

Ass 1

This document outlines an assignment for the Data Structures and Algorithms course at Sinhgad Academy of Engineering for the academic year 2023-2024. It includes six questions related to hashing techniques, including extendible hashing, skip lists, and linear probing, with a total of 30 marks. The assignment is due on January 20, 2025.

Uploaded by

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

Ass 1

This document outlines an assignment for the Data Structures and Algorithms course at Sinhgad Academy of Engineering for the academic year 2023-2024. It includes six questions related to hashing techniques, including extendible hashing, skip lists, and linear probing, with a total of 30 marks. The assignment is due on January 20, 2025.

Uploaded by

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

Sinhgad Technical Education Society’s

SINHGAD ACADEMY OF ENGINEERING, KONDHWA (BK),PUNE


DEPARTMENT OF ELECTRONICS & TELECOMUNICATION.
A.Y.2023-2024 Semester –II Class- S.E. Div-A
Assignment-1
Subject: Data Structures and Algorithms

Maximum Marks: 30 Date of Submission: 20/01/25


________________________________________________________________________________

Q.No Questions Mark CO CL KL


Q1 Add following keys in hash table by applying extendible hashing [05] CO1 Ap P
mechanism. Assume capacity of each directory to store buckets is 3.
Keys are 10, 20, 15, 12, 25, 30, 7, 11, 08.
Q2 Write short note on skip list. [05] CO1 R,U C
Q3 What is hashing? Explain the properties of good hash function [05] CO1 R,U C
with examples.
Q4 We have a hash table of size 10 to store integer keys, with hash function [05] CO1 Ap P
h(x) = x mod 10. Construct a hash table step by step using linear probing
without replacement strategy and insert elements in the order
31,3,4,21,61,6,71,8,9,25. Calculate average number of comparisons
required to search given data from hash table using linear probing without
replacement.
Q5 Insert the following data in the hash table of size 10 using linear [05] CO1 Ap P
probing
with chaining by applying with replacement : 11, 33, 20, 88, 79, 98, 68,
44, 66, 24. Calculate average number of comparisons required to
search given data from hash table.
Q6 Differentiate between Collision and Overflow in hashing technique. [05] CO1 R,U C

Subject Teacher​ ​ ​ Domain Head​ ​ ​ ​ ​ HOD

You might also like