Data Structures Algorithms Mock Test I
Data Structures Algorithms Mock Test I
This section presents you various set of Mock Tests related to Data Structures Algorithms. You
can download these sample mock tests at your local machine and solve offline at your
convenience. Every mock test is supplied with a mock test key to let you verify the final score and
grade yourself.
A - Ο1
B - Οn
C - Οlogn
D - Ο(n2 )
A - Ο(n2 )
B - Ο(nlog n )
C - Ο(n3 )
D - Οn
A - Queue
B - Stack
C - Hash Table
A - n2 spanning trees
B - nn - 1 spanning trees
C - nn + 1 spanning trees
D - nn spanning trees
A - Insertion Sort
B - Merge Sort
C - Shell Sort
D - Heap Sort
B - Reverse Notation
D - Polish Notation
A - unsorted list
B - reverse of input
C - sorted list
Q 8 - In a min-heap:
A - illegal call
B - reverse polish
C - recursive
A - sorted
B - unsorted
C - in a heap
A - queues
B - lists
C - stacks
D - trees
A - LIFO
B - FIFO
C - FILO
Q 13 - Maximum number of nodes in a binary tree with height k, where root is height
0, is
A - 2k − 1
B - 2k+1 − 1
C - 2k-1 + 1
D - 2k − 1
A - Queue
B - Stack
C - Arrays
A - queue
B - stack
C - list
D - none of the above
A - queue
B - stack
C - list
Q 17 - What data structure can be used to check if a syntax has balanced paranthesis ?
A - queue
B - tree
C - list
D - stack
A - True
B - False
C - Recursion
A - Stack
B - Queue
A - true
B - false
Q 22 - Minimum number of moves required to solve a Tower of Hanoi puzzle is
2
A - 2n
B - 2n-1
C - 2n - 1
D - 2n - 1
A - Fibonacci Series
B - Tower of Hanoi
Fn = Fn-1 + Fn-2
A - Armstrong Number
B - Fibonacci Series
C - Euler Number
D - Prime Number
A-5
B-4
C-3
D-2
ANSWER SHEET
1 B
2 D
3 A
4 B
5 B
6 D
7 C
8 A
9 C
10 A
11 C
12 B
13 B
14 D
15 B
16 A
17 D
18 B
19 C
20 C
21 A
22 C
23 D
24 B
25 D
Loading [MathJax]/jax/output/HTML-CSS/jax.js