Algorithm MCQ (Multiple Choice Questions), Algorithm Online Quiz

1 .

An Algorithm is__________

A)

A problem

B)

A real life mathematical problem

C)

A procedure for solving a problem

D)

None of the above

Correct Answer : Option (C) : A procedure for solving a problem

2 .

Dijkstra's algorithm is used to solve __________ problems?

A)

Network lock

B)

Sorting

C)

All pair shortest path

D)

Single source shortest path

Correct Answer : Option (D) : Single source shortest path

Explanation : Dijkstra’s algorithm is used to solve single source shortest path problems.

3 .

An algorithm in which we divide the problem into subproblem and then we combine the subsolutions to form solution to the original problem is known as _________

A)

Brute Force

B)

Divide and Conquer

C)

GreedyAlgorithm

D)

None of the above

Correct Answer : Option (A) : Divide and Conquer

4 .

Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.

A)

Bubble

B)

Merge

C)

Insertion

D)

None of the above

Correct Answer : Option (B) : Merge

5 .

An unordered list contains n distinct elements.

The number of comparisons to find an element in this list that is neither maximum nor minimum is :

A)

O(1)

B)

O (n)

C)

O(!n)

D)

O (n log n)

Correct Answer : Option (A) : O(1)

6 .

Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?

A)

O (n)

B)

O(!n)

C)

O(n^2)

D)

O (n log n)

Correct Answer : Option (C) : O(n^2)

7 .

The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is

A)

148

B)

147

C)

146

D)

140

Correct Answer : Option (A) : 148

8 .

Which of the following sorting algorithms has the lowest worst-case complexity?

A)

Selection Sort

B)

Quick Sort

C)

Bubble Sort

D)

Merge Sort

Correct Answer : Option (D) : Merge Sort

9 .

An algorithm which uses the past results and uses them to find the new results is _________

A)

Brute Force

B)

Divide and Conquer

C)

Dynamic programming algorithms

D)

None of the above

Correct Answer : Option (C) : Dynamic programming algorithms

10 .

A Complexity of algorithm depends upon _________

A)

Time only

B)

Space only

C)

Both (A) and (B)

D)

None of the above

Correct Answer : Option (C) : Both (A) and (B)