B.Sc. II (Semester III) (CBCS) Examination, 2018
data structures (Paper IV)
Day and Date Tuesday, 4-12-2018 Max. Marks 70
Time 2.30 p.m. to 5.00 p.m.
Instructions All questions are compulsory.
Figures to the right indicate full marks.
1. Choose correct alternatives 14
Which of the following is an application of queue
Reversal of string Evaluation of postfix expression
Both and None of these
Traversing binary tree by preorder, then root is found at
position.
First Middle Last Second last
Node of singly linked list has parts.
Single Double Triple Zero
The value contained in parent node of min-heap tree is
Less than child node Equals to child node
Greater than child node Both and
Which of the following operation arises result in "Stack Overflow" situation
IsFull IsEmpty PUSH POP
In which algorithm a main problem is breakdown into two or more
sub-problems
Branch and bound Greedy
Divide and conquer None of these
For the implementation of sort, queue data structure is used.
Bubble Selection Insertion Radix
How many possible binary trees can be constructed using 5 nodes
42 24 55 65
sort method uses divide and conquer strategy.
Quick Bubble Insertion Selection
10) is maximum balance factor of node of AVL tree.
0 1 All of these
11) Which of the following tree allows random as well as sequential access of
keys
B tree B tree Threaded Extended
12) In case of queue, elements are inserted and removed from both
ends.
Linear Circular Priority Deque
13) data structure is useful to implement different kinds of other
data structures.
Stack Queue Linked list Both and
14) search method is applicable over sorted data only.
Linear Binary Both and None of these
2. Answer any four of the following 8
How circular queue is better than linear queue
Write node structure for doubly linked list.
What is collision in hashing
What is complete binary tree
How dynamic memory allocation is better than static memory allocation
Write short note on the following (any two) 6
Selection sort.
Stack in subroutine call.
Greedy algorithm.
3. Answer any two of the following 8
What is stack Write an algorithm for PUSH and POP operation.
Explain "Quick sort" method with example.
What is IRD Explain its Remove_left() and Remove_right()
operation.
Answer any one of the following 6
Write a program that evaluates postfix expression using stack.
Write a program to implement circular queue.
4. Answer any two of the following 10
Write a program to implement binary search method.
Write a program to implement binary tree with tree traversal method.
What is ADT Explain ADT for queue data structure.
Set P
Answer any one of the following 4
Explain following operations of singly circular linked insert_first
remove_after
What is hashing Explain any four hash functions.
5. Answer any two of the following 14
Write a program that counts total number of vowels present in string using
stack.
Explain following operations of binary search tree insert delete_leaf()
search
What is B-tree Write its characteristics and construct B-tree of order five
for following data
78 62 71 10 36 99 75 13 83 34 40 109 23 66 92 62 20 48 52 12