B.C.A. (Semester III) (CBCS) Examination Oct/Nov-2017
DATA STRUCTURE USING
Day Date: Thursday, 09-11-2017 Max. Marks: 70
Time: 02.30 PM to 05.00 PM
Instructions: All Questions are compulsory.
Figures to the right indicate full marks.
Q.1 Choose the correct alternatives: 14
Inorder traversal of the binary tree visits the left of the tree, then the root and
then to the right of the tree.
True False
FIFO is used in
Stack Linked list
Queue None
uses divide and conquer strategy.
Exchange Insertion
Radix Quick
Leaf node of a tree consists of child.
True False
In circular queue, last element again points to in the queue.
last first
middle none
A tree structure that is balanced with respect to the heights of subtree, such a
Tree is called as
Binary tree AVL tree
Threaded binary tree None of these
From remove element from stack is used.
Push Pop
Both a and b None
Linear search is more efficient than binary search.
True False
Linked list uses allocation.
Static Dynamic
Both a and b None
10) The minimum number of fields with each node of double linked list is
1 2
3 4
11) In binary expression tree root is always operator.
True False
12) In AVL tree height balance of every node must be in
2 0
3 0,1
Page 2 of 2
SLR-SD-11
13) Multiple print jobs given to a printer are organized in
FIFO LIFO
Both a and b none
14) ADT stands for
Abstract Data Type Abstract Definition Type
Abstract Default Type None of these
Q.2 Solve any seven from the following 14
State different operations performed on a stack.
Define Linked List.
What do you mean by Height balanced tree?
Define Binary search tree with example.
What is priority queue?
Define Space Complexity and Time Complexity
What is greedy algorithm?
What are the characteristics of an algorithm?
State the different applications of Queue.
Q.3 Solve any two of the following 10
Explain in details 'Bubble sort' method.
Write a function for Preorder and Postorder traversals.
Write an algorithm of conversion of infix expression to postfix expression.
Differentiate between stack and queue 04
Q.4 Write the answer of the following questions(any two) 14
Define Stack. Explain the different operations performed on stack.
Define Searching. Write program for Binary Search.
Write a program for Singly linear linked list and perform the following operation
on it.
Insert at beginning
ii) Insert at end
iii) Insert In between
Q.5 Attempt any two of the followings: 14
Write an algorithm for searching an element in a binary search tree.
Write program to implement Linear queue using array.
Define tree. Explain tree traversal methods in detail.