0 Model Test paper QFR :ACA:08

BCA –302
Data Structure using C and C++

Section –A
Attempt all five questions each carries 3 marks: 3*5=15

1 What is the concept of recursion?

2. Brief the Circular Linked List?
3. What is algorithm analysis in data structure?
4. Explain the concept of D-Queue.
5. Write advantages of circular queues.

Section –B
Attempt any two out of three 71/2 * 2=15
6. Write an algorithm using PUSH and POP in Stack
7. What is BST? Write an insertion algorithm of Binary Search Tree with example?
8. Explain Inorder, Preorder and Postorder Traversal operation on Binary tree with example.

Section – C
Attempt 3 questions out of 5 15*3=45

9. In what way, doubly linked list is better than single linked list. Give examples.
10. Explain the insertion sort algorithm with an example.
11. Draw all possible binary trees that have four terminal nodes and each non-terminal node has two
child node.
12. Write an Algorithm to search an item from linear linked list. Note that linked list is sorted in
descending order.
13. Write an algorithm for Binary Search. How it is better from Linear Search?