Algorithm - Quiz(MCQ)
A)
Post-order Traveral
B)
In-order Traversal
C)
Pre-order Traversal
D)
None of the above

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

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.

A)
size of array
B)
sequence of values
C)
pivot element
D)
None of the above

Correct Answer : Option (C) :   pivot element

A)
B)
C)
takes input which is already sorted.
D)
None of the above

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.

A)
Stable
B)
Unstable
C)
In-Partition
D)
In-Place

Correct Answer : Option (D) :   In-Place

A)
Insertion Sort
B)
Bubble Sort
C)
Merge Sort
D)
Selection Sort

Correct Answer : Option (A) :   Insertion Sort

A)
BFS
B)
Prims Algorithm
C)
Kruskal’s Algorithm
D)
Djikstra’s Algorithm

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

A)
Sentence Ordering
B)
Course Scheduling
C)
D)
All of the above

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

A)
O(1)
B)
O(N)
C)
O(logN)
D)
O(NlogN)

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

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