Code Uncode 2.0

In order traversal of binary search tree will produce −

• unsorted list

• sorted list

• reverse of input

• none of the above

What data structure is used for breadth first traversal of a graph?

• queue

• stack

• list

• none of the above

left_subtree (keys) ≤ node (key) ≤ right_subtree (keys)

• Complete Binary Tree

• Binary Tree

• Binary Search Tree

• All of the above

If the array is already sorted, which of these algorithms will exhibit the best performance

• Merge Sort

• Insertion Sort

• Quick Sort

• Heap Sort

An algorithm is

• a piece of code to be executed.

• a loosely written code to make final code.

• a step by step procedure to solve problem.

• all of the above.

In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?

• It is the easiest possible way.

• To make sure that it is still complete binary tree.

• Because left and right subtree might be missing.

• None of the above!

If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?

• Ο(n), Ο(n)

• Ο(n), Ο(1)

• Ο(1), Ο(n)

• Ο(1), Ο(1)

Program with highest run-time complexity is

• Tower of Hanoi

• Fibonacci Series

• Prime Number Series

• None of the above

If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

• we'll get a different spanning tree.

• we'll get the same spanning tree.

• spanning will have less edges.

• spanning will not cover all vertices.

Which of the following algorithm does not divide the list −

• linear search

• binary search

• merge sort

• quick sort