University of Pune 2007 M.C.A Data Structures and Files Using ‘C‘ - Question Paper

Data Structures and Files Using ‘C‘
MCA MAY-07 (Pune university)

3 hrs 70 marks

1) Q1 and nine are compulsory
2) Solve any 5 from remaining
3) Each ques. carries 10 marks


Q.1
A) Convert INFIX expression to PREFIX form. Show the stack at every step. B*(A+C-D)/E*F/G
B)Write a ANSI C code for sorting an 1-D array of integers using Bubble sort.

Q.2
A) Write a void code to compute sum of all numbers stored in circular queue
B) Write a ANSI C code for finding height/depth of binary search tree.

Q3 Write a program to create reverse linear signally linked list of strings.

Q4
A) Write a void to reverse the contents of the stack.
B) Write a ANSI C code to add 2 polynomials.

Q5)
A) Draw a binary search tree for 23,89,34,67,99,2,55,45,78,12,56. Write preorder post-order traversal for the tree
B) Write a void for non-recursive in-order traversal for the above tree.

Q6) Write short notes on (any two)
A) Expression tree.
B) Threaded binary tree
C) Hashing Technique.

Q7) Construct an AVL tree for the following:
Input,joystick,USB,ROM,Port,ram,windows,X-windows,audio,cache.

Q8)
A) Write a program to transpose 4X4 matrix.
B) Write a void to revers every word of a sentence using stack






Q9) ans the subsequent graph.



A -------E -------D
| / | / |
| / | / |
| / |- F---/ |
C-----B---------- E


A) Generate DFS output
B) Generate BFS output
C) Write an adjacency matrix.
Consider E as starting vertex and adjacent vertex should in alphabetical descending order.

Earning:   Approval pending.