B.C.A. (Semester III) (CGPA) 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: Q.1 and Q.7 are compulsory.
Attempt any two questions from Q. 2 and Q. 4.
Attempt any one question from Q. 5 and Q. 6.
Q.1 Choose correct alternatives. 07
is primitive data structure.
Stack Queue
Linked list Int
If preorder traversal of binary tree is GADBCEF then its post order is
DCBAFGE DCBAFEG
DCBFAEG DBCAFEG
Node of singly linked list does not have pointer.
Next Previous
Header Both a b
In case of circular queue, if "front= rear+1" then queue is
Full Created
Empty Overflows
linked list does not contains NULL part in its node structure.
Singly Doubly
Circular Singly Linear Singly
data structure is used in simulation application.
Array Stack
Queue Tree
To sort numbers, bubble sort requires maximum
comparisons.
47 43
45 49
Q.1 State whether True or False 04
If key comparisons are minimum then searching process fast.
Linked list data structure is useful in polynomial manipulations.
The degree of node of binary tree may be greater than two.
Indexed sequential search requires an auxiliary storage for searching.
Fill in the blanks 03
of a tree does not have any descendants.
PUSH operation of stack becomes successful if stack is
queue allows use insertion in both ends but deletion in only
one end.
Page 2 of 2
SLR-CD-6
Q.2 Attempt any two of the following 14
Write a program to implement circular queue with its basic operations.
What is doubly circular Linked list? Explain its add_first() count() operations.
Write a program that calculates addition of all even numbers in an array.
Q.3 Attempt any two of the followings: 14
Write a program to sort an array elements using quick sort method.
Write an algorithm to „delete‟ existing node from binary search tree.
Write a program to implement stack using linked list.
Q.4 Attempt any two of the followings: 14
How stack is useful in subroutine call?
What is Threaded binary tree? Explain all its types.
Write a program to implement binary search method of searching.
Q.5 Explain following operations of binary search tree.
Count_total()
count_leaf()
inorder()
07
Write a program to convert an expression from infix to prefix form. 07
Q.6 Write a program to implement straight selection sort method. 07
What is Deque? Explain input restricted deque with following operations.
Insert
rem_left()
rem_right()
07
Q.7 Write short notes on the following (Any two) 14
Write algorithm for push and pop operations of stack.
Radix sort
ADT for Priority Queue.