MCA MAGADH UNIVERSITY QUESTION (2016-2019) PROGRAMMING AND DATA STRUCTURE WITH "C"

MCA MAGADH UNIVERSITY QUESTION (2016-2019) PROGRAMMING AND DATA STRUCTURE WITH "C"

                                                   2016-2019
                                              Full marks: 80
                                               Time: 4 hours
                                    The questions are of equal value
                                   Answer any five questions

1.(a) What is algorithm? What are the characteristics of a good algorithm?
        Discuss complexity of algorithm.
   (b) Write an algorithm for binary search.

2. (a) Discuss the data types in 'C'
    (b) Explain different types of operators available in 'C'.

3. (a) Explain with example the relationship of one-dimensional
        array with pointers.
    (b) Differentiate between automatic variables and static variables.

4. (a) Write a 'C' program to display series
        1+ 3+ 5+.......+n.
    (b) Write a 'C' program to add two numbers using pointer.

5. Explain different types of queue. List applications of queue.
 
6. Define with example height balanced tree 'AVL'.

7. Explain BFS & DFS traversals in graph.

8. Describe Dijkstra's shortest path algorithm with a suitable example.

9. Define data structure . What do you mean by abstract data types? Define
    and differentiate between linear and non-linear data structures.

10. Write short notes on any four of the following:
   (a) Binary tree tracersals
   (b) Heap sort
   (c) Time complexity of algorithm
   (d) Static vs. dynamic memory allocation
   (e) Circular queue.