B.C.A. (Semester III) (CGPA) Examination Mar/Apr-2018
DATA STRUCTURE USING
Time: 2½ Hours
Max. Marks: 70
Instructions: Q.1 and Q.7 are compulsory. Attempt any two questions from Q.2 to Q.4. Attempt any one question from Q.5 and Q.6.
Q.1
Choose the correct alternatives:
14
The is not a sorting algorithm.
Quick sort
Binary sort
Selection sort
Radix sort
Hashing is a technique.
Searching
Merging
Sorting
Insertion
The root is processed after its sub trees in traversal.
Inorder
Preorder
Postorder
None of these
algorithm searches a given value or element in an already sorted array by repeatedly dividing the search interval into half.
Hashing
Binary search
Quick Sort
Linear Search
Which of the following sorting technique applied on two sorted lists?
Insertion Sort
Radix Sort
Quick Sort
Merge Sort
In AVL Tree, the Balance Factor of each node is either




The complexity of linear search algorithm is
O
O (log
O
O log
The data structure uses linear order.
Stack
Queue
Array
All of these
is not valid real life example or application of Stack.
Passengers waiting for Bus stand
Recursion
String reversal
None of these
10) The best data structure to check whether an arithmetic expression has balanced parentheses is a
Queue
Stack
Tree
List
11) The Binary tree is linear data structure.
True
False
Page 2 of 2
SLR-CV-1
12) Binary search algorithm cannot be applied to
Sorted Linked list
Sorted binary tree
Sorted linear array
None of these
13) Partition and exchange sort is
Quick sort
Tree sort
Bubble Sort
Heap sort
14) What is postfix form of given expression:




Q.2
What is data structure? Explain different Types of data structure.
05
What is Circular Queue? Explain different operations performed on circular Queue.
05
Define Expression tree and Threaded Binary tree.
04
Q.3
Define the terms:-
Height and Depth of tree
Ancestor and Decedent
Leaf node
05
Write algorithm of Merge Sort.
05
What is ADT? Explain Queue as ADT.
04
Q.4
What is Dequeue? Explain different types of Dequeue.
05
Write a program to implement Bubble sort.
05
Write algorithm of evaluation of postfix expression.
04
Q.5
Write a program to implement Linked list with following operations.
Insert Last
Delete Last
Display List
07
What is Binary Tree? Explain different operation performed on tree.
07
Q.6
Write a program to implement Binary Search tree with following operations.
Insert node
Delete node
Inorder tree traversing
07
What is linear search? Explain with example.
07
Q.7
Write a short note on the following:- (Any
14
AVL Tree
Explain Stack uses in recursion with example
Doubly linked list