Algorithm MCQ (Multiple Choice Questions), Algorithm Online Quiz

1 .

Visiting root node after visiting left and right sub-trees is called

A)

Post-order Traveral

B)

In-order Traversal

C)

Pre-order Traversal

D)

None of the above

Correct Answer : Option (A) : Post-order Traveral

2 .

Which of the below given series is Non-Increasing Order −

A)

1, 3, 3, 6, 8, 9

B)

1, 3, 4, 6, 8, 9

C)

9, 8, 6, 3, 3, 1

D)

9, 8, 6, 4, 3, 1

Correct Answer : Option (C) : 9, 8, 6, 3, 3, 1

Explanation : A sequence of values is said to be in non-increasing order, if the successive element is less than or equal to its previous element in the sequence.

3 .

Quick sort running time depends on the selection of

A)

size of array

B)

sequence of values

C)

pivot element

D)

None of the above

Correct Answer : Option (C) : pivot element

4 .

An adaptive sorting algorithm_______

A)

adapts to new computers.

B)

takes advantage of already sorted elements.

C)

takes input which is already sorted.

D)

None of the above

Correct Answer : Option (B) : takes advantage of already sorted elements.

Explanation : A sorting algorithm is said to be adaptive, if it takes advantage of already 'sorted' elements in the list that is to be sorted.

5 .

What is the technique called in which it does not require extra memory for carrying out the sorting procedure?

A)

Stable

B)

Unstable

C)

In-Partition

D)

In-Place

Correct Answer : Option (D) : In-Place

6 .

Among the following options which is the best sorting algorithm when the list is already sorted?

A)

Insertion Sort

B)

Bubble Sort

C)

Merge Sort

D)

Selection Sort

Correct Answer : Option (A) : Insertion Sort

7 .

Which of the following algorithms are used to find the shortest path from a source node to all other nodes in a weighted graph?

A)

BFS

B)

Prims Algorithm

C)

Kruskal’s Algorithm

D)

Djikstra’s Algorithm

Correct Answer : Option (D) : Djikstra’s Algorithm

8 .

Which of the following are applications of Topological Sort of a graph?

A)

Sentence Ordering

B)

Course Scheduling

C)

OS Deadlock Detection

D)

All of the above

Correct Answer : Option (D) : All of the above

9 .

What is the time complexity in decreasing the node value in a binomial heap?

A)

O(1)

B)

O(N)

C)

O(logN)

D)

O(NlogN)

Correct Answer : Option (C) : O(logN)

10 .

Which of the following is known to be not an NP-Hard Problem?

A)

Vertex Cover Problem

B)

0/1 Knapsack Problem

C)

Travelling Salesman Problem

D)

Maximal Independent Set Problem

Correct Answer : Option (B) : 0/1 Knapsack Problem