BCA-12
June Examination 2017
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 Sorting.
Define non-linear data structure.
Write applications of tree.
What is the purpose of Dijkstra's Algorithm
In tree construction which is the suitable efficient data structure?
How many minimum number of queues needed to implement the priority queue?
583
BCA-12 200 3 (P.T.O.)
BCA-12 200 3 (Contd.)
583
What do you mean by sibling?
(viii) What do you understand by Traversing?
Define overflow condition in a Stack.
Explain what is meant by Bubble Sort.
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 best case, average case and worst case in analysis of
algorithms.
What is the difference between a queue and a stack?
What is the run time complexity of selection sort and insertion
sort?
Describe the purpose of garbage collection?
Write an algorithm for merge sort. State the complexity to sort
n-numbers.
Write an algorithm to delete a node from Linked List.
Explain the binary heap tree with an example.
What are the different searching techniques available? Explain
the hashing method.
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) Write an algorithm to convert infix to postfix using stack.
11) Write short note: (any two)
Depth First Search
Breadth First Search
BST
Dynamic Programming
12) Explain and Construct binary tree from the tree traversals.
In-order: HDIBEAFJCKG
Pre-order: ABDHIECFJGK
13) Explain the Traveling sales man problem using Dynamic
programming in detail.