BCA MAGADH UNIVERSITY QUESTION ( 2007)

BCA MAGADH UNIVERSITY QUESTION ( 2007)

                                                                             2007
                                                                      Time: 3 hours
                                                                     Full Marks: 75
                                              The questions are of equal marks. Answers any
                                                 Five questions. question No 1 is compulsory

1. a) Define data structure
    b) Define algorithm
    c) Explain the application of stack in programming.
    d) What do you understood by priority queue?
    e) How tree can be represented using Linked list?
   
2. What do you understood by stack? Explain push and pop operation associated with stack?

3. Explain each:
    a) Linear queue
    b) Circular queue
    c)  Dequeue

4. What are the advantages of using linked list ? How will you implemented the queue using linked list ?

5. Compare & Contrast doubly linked list and circular linked list, with suitable example.

6. Discuss various operations associated with data structure. And also discuss the various types of data structures.

7. Define each
    a) Binary tree
    b) Threaded binary tree
    c) Height balanced tree

8. How is the traversal possible in case of binary tree ? Explain with suitable example.

9. Discuss the advance feature of Auto CAD.

10. Explain the analysis feature of Auto CAD.