NALANDA OPEN UNIVERSITY QUESTION, MASTER OF COMPUTER APPLICATION(MCA) 2018

NALANDA OPEN UNIVERSITY QUESTION, MASTER OF COMPUTER APPLICATION(MCA)

                                                                          2018
                                                          Part-I, Paper-VIII(new)
                                                         (Data and file structures)
                                                       Annual Examination, 2018
                                                                    Time: 3 hours
                                                                   Full Marks:80               
                                                       Answer any five questions,         
                                                   All questions carry equal marks.

1. Define algorithm. Discuss different types of algorithm complexity.

2. What is an array? Write a program in C to find the sum of two matrices.

3. Describe different types of linked list with an example of each types.

4. What is a circular queue? Write a C program to implement a circular queue. Discuss applications of a circular queue.

5. Define an AVL tree. What are the properties of an AVL tree? Draw an AVL tree for the following series:-
     2  , 10,   6,  8,  16,  18,  20,  12,  15,  30.

6. Discuss bubble sort and quick sort with an example of each.

7. Define Binary Search tree. write a program in C to implement Binary Search Tree.

8. What is the concept of recursion? Write a program in C to explain recursion.

9. Explain the following terms with an example:-
   (i) Binary Tree
   (ii) Push ( ) and Pop( ) operations in Stack.

10. Explain various types of file organization. Also discuss their advantages and disadvantages.