Scribd
Upload
15 views2 pages

DSA Insem 2024 Paper

The document is an exam paper for a Data Structures and Algorithms course, focusing on topics such as hash tables, skip lists, binary trees, and Huffman's tree. It consists of four questions with various sub-questions that require students to construct data structures, explain concepts, and write pseudocode. The exam is designed for S.E. (Computer Engineering) students and has a total of 30 marks, with specific instructions for answering the questions.

Uploaded by

omborude241
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
15 views2 pages

DSA Insem 2024 Paper

The document is an exam paper for a Data Structures and Algorithms course, focusing on topics such as hash tables, skip lists, binary trees, and Huffman's tree. It consists of four questions with various sub-questions that require students to construct data structures, explain concepts, and write pseudocode. The exam is designed for S.E. (Computer Engineering) students and has a total of 30 marks, with specific instructions for answering the questions.

Uploaded by

omborude241
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

TotalNo. of Questions :4| SEAT No.

:
[Total No. of Pages : 2
PB24
|6268|-218
S.E. (Computer Engineering) (Arificial Intelligence &Data Science
Engingering) (Insem)
DATA STRUTURES AND ALGORITHMS
(2019Pattera) (Semester
( - IV) (210252)
[Mac. Marks : 30
Time: 1 Hour]
Instructions to theecundidates
1) Answer Qtor .203 or Q.4.
2) Neat iagrams ust be drawn wherever necessary.
3) Figices to c-e right indicate full marks.
14

4) Assume suitable data if necessary

7
Q1) a) Fokthe given set ofvalues: 76,40,48,5,55 Constrict ahash table with size
and resolve collision using quadraticprobing, (6]

b) Explain about skip list in Hashing Give applications of skip list. 14]

C) What is hash function? Wha are chatacteristics of good hash function?(5]

into hash table using


02) a) Prepare hash table by Jàserting following Elements i03/[Link]
extendible hashing: l6, 4,6, 22, 24, 10, 31, 7, 9, 20, 26. Bucket Size
(Assume) ap014871
b) Explain applications ofHash Table. [4]

c) What is hashing? Explain different methods ofhash furiction calculation. [5]

03) a) Explain how to convert general tree to binary ttee wiyexampie.


b) Write non recursive pseudocode for inárder trersal of Binary tree. (S)
c) Describe binary search tree deletion with example. [6)

OR

PIO.
04) a) Write pseudocode for BES traversal of binary scarch tree. 14]

b) Construct Hufiman's tree and determine code for following characters


whose frequencies are as given

Character ANB D E

10 30 30
Frequency

of Threaded binary three? Explain advantages and


c) 1 4 .is
What 14he3neçessity
.170.%
[6]
disadrantages, of TBT. 14

[Link]

CEGPO1427P

21/03/2024

[Link]

14
[Link]

CEGPO14271

21/03/2024

[Link]

2
[6268|-218

You might also like