Time: 2.30 Hrs. M.M.: 100
Note: All questions are compulsory.
1. Attempt any four parts: 5*4=20
a) What is problem solving concept?
b) What are pointer variable and constants?
c) What is the advantage & disadvantage of arrays?
d) What is link-list in data structure? How it represents in memory?
e) What is the concept of binary search tree?
f) What is recursion, Explain with an example.
2. Write short notes (any five): 5*4=20
(a) Index formula for arrays (b) Link-list traversing
(c) Searching algorithms (d) AVL Tree
(e) Application of linked lists (f) Hash table
3. Attempt any one part: 1*10=10
a) What is data structure, explain various operation on data structure in brief?
b) Explain traversing in a binary tree. Reconstruct the original tree for the following pre order and in Order sequence.
Pre order -1,2, 3,4, 5, 6, 7, 8,9
In order —2,3, 1,5,4, 7, 8, 6, 9
4. Attempt any two parts: 2*10=20
a) Write a C program for insertion sort algorithm? Also explain the insertion short with example.
b) Construct an AVL tree by using following nodes - 8, 14, 7, 3, 10, 4, 12, 1.
c) Write down an algorithm lord insertion a node in linked list at beginning, end and middle.
5. Write difference any four: 4*5=20
a) Top down and bottom up design approach.
b) Single dimensional Vs Multidimensional array.
c) Circular Queue Vs De-Queue.
d) Squaretail table Vs "Rash table.
e) linear search Vs Binary search.
f) Pre order Vs Post order traversing.