You are on page 1of 2

KOLHAPUR INSTITUTE OF TECHNOLOGY’S,

COLLEGE OF ENGINEERING (AUTONOMOUS), KOLHAPUR


(AFFILIATED TO SHIVAJI UNIVERSITY, KOLHAPUR)

S.Y. B.Tech. (Computer Science & Engineering)


(Semester- III)
END SEMESTER EXAMINATION, DECEMBER- 2021
Course Code : UCSE0303
Course Name : Data Structures

Day and Date : Friday , 24-Dec-21 PRN :


Time : 09:30 AM To 11:30 AM Max Marks: 50

Instructions:
IMP: Verify that you have received question paper with correct course, code, branch etc.
i) All questions are compulsory.
ii) Figure to the right indicate full marks.
iii) Assume suitable data wherever necessary.

Marks B.L CO’s

Q.1 Attempt any Two 16


A What is Hashing ? What is Collision in Hashing ? Explain 1 CO-1
different collision resolution techniques.
B Write an algorithm/pseudo code to convert a given infix 5 CO-3
expression to postfix expression? Trace the steps involved in
converting the given infix expression ((A +B)^C)-((D*C)/F) to
postfix expression.
C What is Linked List ? With neat diagram explain SLL, DLL. 3 CO-1
Write syntax for getting dynamic memory allocated for a node in
SLL and explain.

Q.2 Attempt any two 16


A Write an algorithm/pseudo code to sort elements using Heap sort 5 CO-4
technique ? Illustrate the working of Heap sort algorithm on the
following input and sort : 20,15, 10, 11,18, 45, 3, 9, 17, 6
B Explain Merge Sort algorithm/pseudo code with the help of an 3 CO-3
example? Mention the best case and worst case time complexity
of Merge sort algorithm?
C What is AVL tree explain its properties ? Sort the following 3 CO-1
numbers using AVL tree with neat diagram: 12, 5, 10, 100, 8, 4,
3, 9, 7, 6

Page 1 of 2
Q.3 Attempt any Three 18 CO-2
A Write down the inorder, preorder and postorder traversal of the 4
following binary tree

B What is a binary search tree (BST), explain its properties ? Sort 3 CO-2
the following numbers using binary search tree with neat diagram:
2, 15, 10, 1, 18, 4, 3, 9, 7, 6
C Give algorithm/pseudo code for DFS. 3 CO-4
Write the DFS Traversal for the following graph.

D Give algorithm/pseudo code for BFS. Write the BFS Traversal for 3 CO-4
the following graph.

*******************

Page 2 of 2

You might also like