M.C.A-M.C.A 2nd Sem IT-21 : 201 : DATA STRUCTURES USING "C"(University of Pune, Pune-2013)
M.C.A. (Semester - II) (Management Faculty) Examination, 2013
IT-21 : 201 : DATA STRUCTURES USING "C"
(2008 Pattern) (New)
Time : 3 Hours Max. Marks : 70
Instructions :1) Question 1 is compulsory.
2) Solve any five from Q. 2 to Q. 8.
3) Assume suitable data wherever necessary.
4) Draw suitable diagram wherever necessary.
5) Figures to right indicate full marks.
1. A) A graph is implemented as adjacency list of N nodes. Write a non-recursive
function for Depth first search traversal.
B) Define Data structure.
C) A float array is defined as float no [50] [60] [70] [80]. Find the address of
element no [20] [30] [40] [50].
D) Write a note on Abstract Data type.
2. Write a program to multiply two polynomials.
3. Write a program using function create ( ), insert ( ), delete ( ), display ( ) for
doubly Linear linked list.
4. Convert the following in fix expressing into its equivalent postfix and prefix form.
Show contents of stack in table format.
(A + B)*C - D / E ÙF
5. Draw an AVL tree for the following. Nanded, Pokhran, Pune, Revasa, Solapur,
Jamkhed, Amravati, Parner, Mumbai, Yavatmal.
6. Write short notes on : 10
A) DEQUEUE
B) Generalized Linked list.
7. A) Write an algorithm for Non-recursive preorder traversal of Binary search tree. 5
B) Draw a Binary search tree for the following data 5
70, 80, 50, 90, 10, 20, 65, 100
Write preorder and postorder traversals for the above tree.
8. A) Write a function to insert node in threaded binary tree. 5
B) Explain Applications of Queue. 5
| Earning: ₹ -2.00/- |
