Scribd
Upload
17 views2 pages

Dsa Phase2

Uploaded by

Abbhinav Jaiin
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
17 views2 pages

Dsa Phase2

Uploaded by

Abbhinav Jaiin
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/ 2

VPM P POLYTE CHNIC, G ANDHI N AG AR

Second Mid-sem Exam: December 2023 (3rd Semester)


Subject Name: DSA [4330704]
Date: 21/12/2023 Duration: 1 hour
Total Marks: 20

Questions Marks
Q-1 Answer the following questions (8 marks)
A Define hashing. List out hashing techniques. 2
B Write an algorithm for Queue (Insert and Delete operations). 3
C Write an algorithm to insert a node in beginning in single linked list. 3
OR
C Write an algorithm to delete a last node of single linked list. 3
Q-2 Answer the following questions (12 marks)
A Difference between Single Linked list and circular linked list. 3
B Write an algorithm of Bubble sort. 2
OR
B Write an algorithm of Merge sort. 2
C Define collision. List out any two collision resolution techniques. 2
D Generate BST for the following data: 5
10(root node), 8, 2, 7,16,11,9,3,5,14
Give pre-order, in-order, post-order tree traversal for that tree.

VPM P POLYTE CHNIC, G ANDHI N AG AR


Second Mid-sem Exam: December 2023 (3rd Semester)
Subject Name: DSA [4330704]
Date: 21/12/2023 Duration: 1 hour
Total Marks: 20

Questions Marks
Q-1 Answer the following questions (8 marks)
A Define hashing. List out hashing techniques. 2
B Write an algorithm for Queue (Insert and Delete operations). 3
C Write an algorithm to insert a node in beginning in single linked list. 3
OR
C Write an algorithm to delete a last node of single linked list. 3
Q-2 Answer the following questions (12 marks)
A Difference between Single Linked list and circular linked list. 3
B Write an algorithm of Bubble sort. 2
OR
B Write an algorithm of Merge sort. 2
C Define collision. List out any two collision resolution techniques. 2
D Generate BST for the following data: 5
10(root node), 8, 2, 7,16,11,9,3,5,14
Give pre-order, in-order, post-order tree traversal for that tree.

You might also like