NEW
Font size
WorksheetsADA
Total questions: 10
Worksheet time: 6mins
What is the worst case run-time complexity of binary search algorithm?
Ο(n2)
Ο(nlog n)
Ο(n3)
Ο(n)
Q 2 - push() and pop() functions are found in
queues
ists
stacks
trees
Which of the following is an example of dynamic programming approach?
Fibonacci Series
Tower of Hanoi
Dijkstra Shortest Path
All of the above
Which of the following searching techniques do not require the data to be in sorted form
Binary Search
Interpolation Search
Linear Search
All of the above
Which method can find if two vertices x & y have path between them?
Depth First Search
Breadth First Search
Both A & B
None A or B
How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4}
4
5
6
7
Linked list search complexity is
Ο(1)
Ο(n)
Ο(log n)
Ο(log log n)
A balance factor in AVL tree is used to check
what rotation to make.
if all child nodes are at same level.
when the last rotation occured.
if the tree is unbalanced
A queue follows __________
FIFO (First In First Out) principle
LIFO (Last In First Out) principle
Ordered array
Linear tree
Circular Queue is also known as ________
Ring Buffer
Square Buffer
Rectangle Buffer
Curve Buffer
