Nalanda Open University 2010 M.C.A Computer Aplications Master of Computer Application Part–II, –XVI (Data and File Structures) Annual , - Question Paper
Master of Computer Application Part–II, Paper–XVI (Data and File Structures) Annual Examination, 2010
N ALAN DA OPEN UNIVERSITY Master of Computer Application Part-II, Paper-XVI (Data and File Structures)
Annual Examination, 2010 Full Marks : 80 Time : 3 Hours.
Answer any Five Questions.
Ali questions carry equal marks.
1. Write an algorithm for the addition of two polynomials in one variable.
2. Define a stack. Explain the operations that can be performed on a stack. How are multiple stack implemented using arrays?
3. Define dequeue. Write an algorithm for the implementation of a dequeue using arrays.
4. Define an AVL tree. In case an AVL tree becomes unbalanced, how will you balance it? Explain with example(s).
5. Defme a Splay tree. Explain the possible splay rotations.
6. Write an algorithm for the multiplication of two sparse matrices.
7. Construct a B-Tree for the following data. Show all intermediate steps during the process
ID hkzbpoqeaswtclnymI
8. What is cylinder-surface indexing? Explain it with an example. Also, write its merits and demerits.
9. Write an algorithm for multiplication of two sparse matrices.
10. Explain a circular linked list. Write an algorithm to insert and delete an element in circular linked list.
|
Attachment: |
| Earning: Approval pending. |
