B.C.A. (Semester III) (CBCS) Examination Nov/Dec-2018
DATA STRUCTURES USING
Time: 2½ Hours Max. Marks: 70
Instructions: All Questions are compulsory.
Figures to the right indicate full marks.
Q.1 Choose the correct alternatives: 14
Which of the following data structure allows random access of elements?
Stack Queue
Linked list Tree
Which of the following queue allows us to add or delete elements from both
ends?
Linear Circular
Priority Deque
Which of the following linked list has double parts in its node structure?
Singly linear Doubly linear
Doubly circular Both b c
In binary tree, the degree of node is always zero.
Root node Terminal node
Non-terminal node Both b c
"Stack Overflow" situation occurs while performing operation. O
IsFull( IsEmpty(
PUSH( POP(
In which algorithm a main problem is breakdown into two or more subproblems?
Branch bound Greedy
Divide conquer None of these
sort method belongs to exchange sort category.
Bubble Merge
Insertion Radix
We can construct number of possible binary trees using nodes.
n
− n − n
Bubble sort method uses number of maximum possible swapping
to sort elements.
5 15
25 35
10) Which of the following tree is also called as balanced binary tree?
Threaded binary tree Skewed Binary tree
AVL tree All of these
11) In which type of queue largest element will processed firstly?
Linear Ascending priority
Descending priority Deque
Page 2 of 3
SLR-SH-11
12) Which of the following is default memory allocation?
Dynamic Runtime
Compile time Both a b
13) Which data structure is useful to implement different kinds of other data
structures?
Stack Queue
Linked List Both a b
14) search method is applicable over sorted as well as unsorted data.
Linear Binary
Both a b None of these
Q.2 Answer any four of the followings: 08
Why queue is called FIFO data structure?
What is sorting? Write its advantages.
Represent binary tree in static dynamic form by considering following
numbers
12, 63, 87, 55, 98, 52, 10, 63
Write difference between stack and queue.
What is time space complexity?
Write short note on followings. (Any Two) 06
Quick Sort
Use of stack in recursion
ADT for queue
Q.3 Answer any two of the followings: 08
Write an algorithm that evaluates postfix expression using stack.
Explain „Indexed sequential search method‟ in details.
What is Array? Explain types of array in detail.
Answer any one of the following. 06
Write a program to implement singly linear linked list with following
operationsi)
InsertFirst()
ii) RemoveLast()
iii) Search()
iv) Display()
Write a program to implement binary search method that searches entered
element.
Q.4 Answer any two of the followings:- 10
Write a program to implement circular queue.
Write a program to implement binary tree with tree traversal method.
What is Stack? Explain its basic operations.
Answer any one of the followings: 04
Write algorithm for bubble sort method. And sort following numbers in
Ascending order using bubble sort.
56, 78, 97, 20, 10
What is doubly linear linked list? Implement function that reverses it.
Page 3 of 3
SLR-SH-11
Q.5 Answer any two of the followings:- 14
Write a program that counts total number of vowels present in string using
stack.
What is ORD? Explain its following operations.
insert_left(
insert_right(
remove(
What is doubly circular linked list? Explain its following operations-
Add_after(
Remove_after(
Count(