University Of Pune Question Paper
M.C.A. (Semester – II) (Management Faculty) Examination 2010
(IT-21) 201 : DATA STRUCTURE USING ‘C’
(2008 Pattern) (New)
Time : 3 Hours Max. Marks : 70
Instructions :1) Question 1 is compulsory.
2) Solve any 5 from 2 to 8.
3) Assume suitable data whenever necessary.
4) Draw suitable diagram whenever needed.
5) Figures at right hand indicate full marks.
1. A) A graph is implemented by Adjancency Matrix. Write non recursive algorithm
for depth first search. 7
B) Define Acyclic Graph 3
C) A integer Array is defined as x [100] [40] [40]. Find the address of cell
x [80] [30] [20] 5
D) Write short note on Applications of Graph. 5
2. Write a program for addition of two polynomials. 10
3. Write a program to implement priority queue using linked list. 10
4. Write a program to evaluate postfix expression. 10
5. Draw AVL Tree for the following : 10
Nita, Pratik, Priti, Ravan, Somu, Joggy, Amar, Parmeet, Naresh, Varun.
6. Write short notes on : 10
1) B tree
2) Expression tree.
7. A) Write an algorithm to insert and delete an element from a Queue. 5
B) Draw Binary search tree from the following data. 5
55, 60, 30, 25, 70, 10, 80.
Write postorder Traversal for the above tree.
8. A) Write a function to delete an element in B tree. 5
B) Explain space complexity and time complexity. 5
––––––––––––––––––––––
M.C.A. (Semester – II) (Management Faculty) Examination 2010
(IT-21) 201 : DATA STRUCTURE USING ‘C’
(2008 Pattern) (New)
Time : 3 Hours Max. Marks : 70
Instructions :1) Question 1 is compulsory.
2) Solve any 5 from 2 to 8.
3) Assume suitable data whenever necessary.
4) Draw suitable diagram whenever needed.
5) Figures at right hand indicate full marks.
1. A) A graph is implemented by Adjancency Matrix. Write non recursive algorithm
for depth first search. 7
B) Define Acyclic Graph 3
C) A integer Array is defined as x [100] [40] [40]. Find the address of cell
x [80] [30] [20] 5
D) Write short note on Applications of Graph. 5
2. Write a program for addition of two polynomials. 10
3. Write a program to implement priority queue using linked list. 10
4. Write a program to evaluate postfix expression. 10
5. Draw AVL Tree for the following : 10
Nita, Pratik, Priti, Ravan, Somu, Joggy, Amar, Parmeet, Naresh, Varun.
6. Write short notes on : 10
1) B tree
2) Expression tree.
7. A) Write an algorithm to insert and delete an element from a Queue. 5
B) Draw Binary search tree from the following data. 5
55, 60, 30, 25, 70, 10, 80.
Write postorder Traversal for the above tree.
8. A) Write a function to delete an element in B tree. 5
B) Explain space complexity and time complexity. 5
––––––––––––––––––––––
0 comments:
Pen down your valuable important comments below