Data Structures and Programming - DSPM Paper 1

Data Structures and Programming Methodology
(B.Tech 3rd Semester, 2122)
Time : 3 Hours Maximum Marks : 60
NOTE:- This paper consist of Three Sections. Section A is compulsory. Do any Four questions from
Section B and any two questions from Section C

Section-A Marks : 20
1(a) Define the term Data Structure.
(b) What is recursion and advantages ?
(c) Define full tree and complete tree.
(d) Write infix equvilent of :
abc * c/-d+
(e) What is Priority Queue ?
(f) Whay do we go for dynamic data storage ?
(g) What is the criteria behind the design of hash function ?
(h) Name various application of Stacks and Queues.
(i) What are the various ways to store the Graphs in Memory ?
(j) Whay are the advantages of circular link list ?
Section-B Marks:5 Each
2. Write an algrothim to check whether a given string is palindrom or not using stacks.
3. in what way, double linked listis better than single link list. Give example.
4. Construct a binary tree whose nodes are in two orders as under :
inorder : B, C, E, D, F, A, G, H
Preorder : A, B, C, D, E, F, G, H
5. Compare the time complexity of various sorting algrothims (Best and Worst case).
6. Write a non-recursive algrothim to insert a node into a single-lin list.
Section-C Marks : 10 Each
7.(a) What is Graph ? Can a tree can be Graph ? Name various applications of Graph.
(b) Write a function to delete a node from a binary search tree.
8.(a) An array contains 25 elements. Write an algo to print all pirs whose sum is 20.
(b) Define Garbage Collection. When it takes place and how ?
9. Write short notes on the following :
(a) Operations on sets
(b) Methods for Hash functions