Scribd
Upload
9 views

Dsa Se Comp IV Insem Pyqpapers

The document is an examination paper for the Data Structure & Algorithm course, consisting of four questions with various sub-questions. Candidates are instructed to answer specific questions and provide diagrams where necessary. The exam covers topics such as hashing, binary trees, and tree terminology, with a total of 30 marks allocated.

Uploaded by

61 yogesh wavale
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
9 views

Dsa Se Comp IV Insem Pyqpapers

The document is an examination paper for the Data Structure & Algorithm course, consisting of four questions with various sub-questions. Candidates are instructed to answer specific questions and provide diagrams where necessary. The exam covers topics such as hashing, binary trees, and tree terminology, with a total of 30 marks allocated.

Uploaded by

61 yogesh wavale
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/ 4

Total No. of Questions: 4] SEAT No.

:
Total No. of Pages: 2
SE/In-semester April-2022
S.E. (Computer) (Semester - IV)
DATA STRUCTURE & ALGORITHM(210253)
(2019 Pattern)
[Time:1hour]
[Max.Marks:30]
Instructions to the candidates:
1) AnswerQ.1orQ.2,Q.3orQ.4
2) Figures to the right side indicates full mark
3) Draw neat diagram wherever necessary.
4) Assume suitable data, if necessary.

Q1) a) Insert ki at first location from (u+i2 )%m where i= 0 to m-1 [5] CO1
K= {3, 2, 9, 6, 11, 13, 7, 12) m=10 h(k)=2k+3 use division method and
Quadratic probing to store this values.
b) Define following [5] CO1
a. Bucket b. Collision c. Hash function d. Load Density e. Overflow
c) Explain any two hash function method with example. [5] CO1
OR
Q2) a) Define Hash function? Enlist the characteristic of good hash function. [5] CO1

b) Solve following problem using linear probing without replacement, use [5] CO1
following data key= { 5,18,55,78,35,15} f(key)=key % 10.
c) What is hashing? Explain open and close hashing. [5] CO1

Q3) a) Define basic tree terminology [5] CO2


a. Tree b. Height c. Degree d. Path e. Terminal Node
b) Create Binary tree from given order [5] CO2
Inorder-- E, A, C, K, F, H, D, B, G

1
Preorder—F, A, E, K, C, D, H, G, B

c) Write code for following function [5] CO2


a. Find height of binary tree
b. Search a value from binary search tree

OR
Q4) a) Convert the following tree to binary tree step by step [5] CO2

b) Create Binary tree from given order [5] CO2


Inorder—B, I, D, A, C, G, E, H, F
Postorder—I, D, B, G, C, H, F, E, A
c) Write and Explain code for TBT Inorder traversal. [5] CO2

2
Total No. of Questions: 4] SEAT No.:
Total No. of Pages: 2
SE/In-semester April-2022
S.E. (Computer) (Semester - IV)
DATA STRUCTURE & ALGORITHM(210253)
(2019 Pattern)
[Time:1hour]
[Max.Marks:30]
Instructions to the candidates:
1) AnswerQ.1orQ.2,Q.3orQ.4
2) Figures to the right side indicates full mark
3) Draw neat diagram wherever necessary.
4) Assume suitable data, if necessary.

Q1) a) What is hashing? Explain open and close hashing. [5] CO1
b) Define Hash function? Enlist the characteristic of good hash function. [5] CO1
c) Solve following problem using linear probing without replacement , use [5] CO1
following data key= { 5,18,55,78,35,15} f(key)=key % 10
OR
Q2) a) Define following [5] CO1
a. Bucket b. Collision c. Hash function d. Load Density e. Overflow

b) Explain any two hash function method with example. [5] CO1
c) Insert ki at first location from (u+i2 )%m where i= 0 to m-1 [5] CO1
K= {3, 2, 9, 6, 11, 13, 7, 12) m=10 h(k)=2k+3 use division method and
Quadratic probing to store this values.

Q3) a) Define basic tree terminology [5] CO2


a. Tree b. Height c. Degree d. Path e. Terminal Node
b) Create Binary tree from given order [5] CO2
Preorder – G,B,Q,A,C,K,F,P,D,E,R,H

1
Inorder – Q,B,K,C,F,A,G,P,E,D,H,R
c) Write code for following function [5] CO2
a. Find height of binary tree
b. Search a value from binary search tree

OR
Q4) a) Convert the following tree to binary tree step by step [5] CO2

b) Create Binary tree from given order [5] CO2


Inorder—B, I, D, A, C, G, E, H, F
Postorder—I, D, B, G, C, H, F, E, A
c) Write and Explain code for TBT preorder traversal. [5] CO2

You might also like