Data Structures

1 - What is the worst case run-time complexity of binary search algorithm?

A - Ο(n2)

B - Ο(nlog n)

C - Ο(n3)

D - Ο(n)

2 - What data structure can be used to check if a syntax has balanced paranthesis ?

A - queue

B - tree

C - list

D - stack

3 - Travelling salesman problem is an example of

A - Dynamic Algorithm

B - Greedy Algorithm

C - Recursive Approach

D - Divide & Conquer

4 - Maximum degree of any vertex in a simple graph of vertices n is

A - 2n - 1

B - n

C - n + 1

D - n - 1

5 - Graph traversal is different from a tree traversal, because

A - trees are not connected.

B - graphs may have loops.

C - trees have root.

D - None is true as tree is a subset of graph. Show Answer

6 - The Θ notation in asymptotic evaluation represents −

A - Base case

B - Average case

C - Worst case

D - NULL case Show Answer

7- Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

A- Insertion Sort

B- Quick Sort

C- Heap Sort

D- Merge Sort

8 - Program with highest run-time complexity is

A - Tower of Hanoi

B - Fibonacci Series

C - Prime Number Series

D - None of the above Show Answer

9 - Binary search tree is an example of complete binary tree with special attributes.

A - BST does not care about complete binary tree properties.

B - BST takes care of complete binary tree properties.

C - It depends upon the input.

D - None of the above. Show Answer

10 - Interpolation search is an improved variant of binary search. It is necessary for this search algorithm to work that −

A - data collection should be in sorted form and equally distributed.

B - data collection should be in sorted form and but not equally distributed.

C - data collection should be equally distributed but not sorted.

D - None of the above. Show Answer

{"name":"Data Structures", "url":"https://www.quiz-maker.com/QMQCI5Y","txt":"1 - What is the worst case run-time complexity of binary search algorithm?, 2 - What data structure can be used to check if a syntax has balanced paranthesis ?, 3 - Travelling salesman problem is an example of","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}

Quiz Maker