Nalanda Open University 2009 B.C.A Computer Application Final , , Part I, VI (CS 62), (For Old Students Only) - Question Paper
Final Examination, 2009, BCA Part I, Paper VI (CS 62), (For Old Students Only)
Final Examination, 2009 Bachelor of Computer Application, Part-1,
Paper-VI (CS-62)
[ For Old Students only ]
Time : 2.00 Hrs. Full Marks : 60
Answer any five questions. All questions carry equal marks.
1. WAP in C to insert and delete an element in a double ended queue.
2. WAP in C to convert a prefix expression to postfix expression.
3. Draw a 3-way B-tree for the following series of element: -
A, B, E, X, U, V, G, F, I, C, H, Y, T.
4. Write short notes on:
(a) Arrays
(b) Kruskal's Algorithm
(c) Sparse Matrix
(d) DFS (Depth First Search)
5. The following keys are inserted in the order shown, into an AVL tree. Draw an AVL tree for the same. January, February, March, April, May, June, July, August, September, October, November, December.
6. Different between the following giving an example for each:-
(a) Sequential file organisation and Direct File Organisation.
(b) De queue and Circular queue.
(c) Recursive algorithm and Non-Recursive algorithm.
7. WAP in C to search a node in Binary Search Tree (BST)
8. What is Preorder, Inorder and Postorder traversal. Explain giving examples.
9. Construct the binary tree that has the following inorder and preorder traversals.
Inorder : B, E, D, A, F, H, G, C
Preorder : A, B, D, E, C, F, G, H.
10. Differentiate between stack and queue. Write algorithms for implementing both.
|
Attachment: |
| Earning: Approval pending. |
