Scribd
Upload
11 views

be_artificial-intelligence-and-data-science_semester-4_2024_march_data-structures-and-algorithms-ds-a-2019-pattern

This document is an examination paper for a Data Structures and Algorithms course, specifically for the S.E. (Computer Engineering) program. It contains four questions, each with multiple parts, covering topics such as hash tables, binary trees, and Huffman's coding. Candidates are instructed to answer specific questions and are given a total of 30 marks for the exam.

Uploaded by

23158006
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

be_artificial-intelligence-and-data-science_semester-4_2024_march_data-structures-and-algorithms-ds-a-2019-pattern

This document is an examination paper for a Data Structures and Algorithms course, specifically for the S.E. (Computer Engineering) program. It contains four questions, each with multiple parts, covering topics such as hash tables, binary trees, and Huffman's coding. Candidates are instructed to answer specific questions and are given a total of 30 marks for the exam.

Uploaded by

23158006
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Total No. of Questions : 4] SEAT No.

8
23
PB24 [Total No. of Pages : 2

ic-
[6268]-218

tat
S.E. (Computer Engineering) (Artificial Intelligence & Data Science

1s
Engineering) (Insem)

6:4
02 91
DATA STRUCTURES AND ALGORITHMS

3:4
0
(2019 Pattern) (Semester - IV) (210252)

41
Time : 1 Hour]
1/0 13 [Max. Marks : 30
0
Instructions to the candidates:
3/2
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4.


2) Neat diagrams must be drawn wherever necessary.
E
82

8
3) Figures to the right indicate full marks.
C

23
4) Assume suitable data if necessary

ic-
16

tat
8.2

Q1) a) For the given set of values: 76,40,48,5,55 Construct a hash table with size 7

1s
.24

and resolve collision using quadratic probing. [6]


6:4
91
49

3:4
b) Explain about skip list in Hashing. Give applications of skip list. [4]
30
41
01
02

c) What is hash function? What are characteristics of good hash function?[5]


3/2
GP

OR
1/0
CE
82

8
Q2) a) Prepare hash table by Inserting following Elements into hash table using

23
.23

extendible hashing: 16, 4, 6, 22, 24, 10, 31, 7, 9, 20, 26. Bucket Size: 3
ic-
16

(Assume) [6]
tat
8.2

1s

b) Explain applications of Hash Table. [4]


.24

6:4
91
49

3:4

c) What is hashing? Explain different methods of hash function calculation.[5]


30
41
01
02
3/2
GP

Q3) a) Explain how to convert general tree to binary tree with example. [4]
1/0
CE
82

b) Write non recursive pseudocode for inorder traversal of Binary tree. [5]
.23

c) Describe binary search tree deletion with example. [6]


16
8.2

OR
.24
49

P.T.O.
Q4) a) Write pseudocode for BFS traversal of binary search tree. [4]

8
23
b) Construct Huffman’s tree and determine code for following characters

ic-
tat
whose frequencies are as given : [5]

1s
6:4
Character A B C D E

02 91
3:4
0
41
Frequency 20
1/0 13
0 10 10 30 30
3/2
c) What is the necessity of Threaded binary three? Explain advantages and
.23 GP

disadvantages of TBT. [6]


E
82

8
C

23
ic-
16

tat
8.2

1s

.24

6:4
91
49

3:4
30
41
01
02
3/2
GP
1/0
CE
82

8
23
.23

ic-
16

tat
8.2

1s
.24

6:4
91
49

3:4
30
41
01
02
3/2
GP
1/0
CE
82
.23
16
8.2
.24

[6268]-218 2
49

You might also like