NALANDA OPEN UNIVERSITY QUESTION, 2012 , M.C.A, Part-II , Paper-XVI (Data and File Structure)

NALANDA OPEN UNIVERSITY QUESTION, 2012 , M.C.A,  Part-II , Paper-XVI (Data and File Structure)

                                                                             2012
                                                                    Time: 3 hours
                                                                    Full Marks: 80
                                      Answer any Five Questions. All questions carry equal marks.


1. Define an algorithm . Explain how efficiency of an algorithm depends on the resources used by the algorithm. What is the trade-off between space and time complexity?

2. Explain Singly Linked lists, doubly linked lists and circularly linked lists with an example each. What is the application of a linked list.

3. What is a stack? How stacks are implemented? Explain some applications of stocks.

4. Write a program in C to implement recursive Inorder, Preorder and postorder traversal of a binary tree.

5. Define a multiway tree of order m. Create a B-tree of order 5 for the following:-
    CNGAHEKMSQLWTZDPRXYS

6. Compare Kruskal's and Prim's algorithm? Explain with the help of an example. Which graph traversal is recursive by nature.

7. Explain Internal sorting and External sorting. Explain Quicksort with an example.

8. Explain different types of file structure with their advantages and disadvantages.

9. Write a function to check the overflow condition of a list represented by an array.

10. Write short notes on any three:
       (i) Depth First search
       (ii) Splay Trees
       (iii) Heap sort
       (iv) Circular queue.