BCA-12
June Examination 2016
BCA Pt. II Examination
Data Structure and Algorithm
Paper BCA-12
Time 3 Hours Max. Marks 100
Note: The question paper is divided into three sections B and C. Write answers as per given instructions.
Section A 10 × 2 20
(Very Short Answer Questions)
Note: Answer all questions. As per the nature of the question delimit your answer in one word, one sentence or maximum upto 30 words. Each question carries 2 marks.
Define data structure.
Define array.
Define stack
Define queue.
Define Linked list.
Define Binary Search Tree.
Define graph.
(viii) Give the definition of the minimum spanning trees.
583
BCA-12 200 3 (P.T.O.)
BCA-12 200 3 (Contd.)
583
State Principle of Optimality.
What is time complexity?
Section B 4 × 10 40
(Short Answer Questions)
Note: Answer any four questions. Each answer should not
exceed 200 words. Each question carries 10 marks.
Explain the type of data structure with example.
Give a Comparison of Linked List and Array.
Explain PUSH and POP operation in stack.
What are the various operations of queue? Explain with
algorithm.
Write an algorithm for traversing a BST inorder, preorder and
postorder form.
Write an algorithm to traversal graph in DFS.
Write a recursive function to compute factorial of a given
number.
Explain the binary search technique with a suitable example.
BCA-12 200 3
583
Section C 2 × 20 40
(Long Answer Questions)
Note: Answer any two questions. You have to delimit your each
answer maximum upto 500 words. Each question carries
20 marks.
10) Explain height balance tree and AVL tree with suitable
example.
11) Define singly link list. Explain the traversal and searching in
singly link list with algorithm.
12) Explain insertion sort technique with suitable example.
13) Explain the concept of asymptotic notations and why do we
use it? Explain different asymptotic notations.