Algorithm MCQ (Multiple Choice Questions), Algorithm Online Quiz

1 .

Identify the description of a linear search

A)

Elements do not need to be in order, check each item in turn

B)

Put the elements in order, check each item in turn

C)

Put the elements in order, compare to the middle value, split the list in order and repeat

D)

Elements do not need to be in order, compare to the middle value, split the list in order and repeat

Correct Answer : Option (A) : Elements do not need to be in order, check each item in turn

2 .

Identify the description of a binary search

A)

Put the elements in order, check each item in turn

B)

Elements do not need to be in order, check each item in turn

C)

Elements do not need to be in order, compare to the middle value, split the list in order and repeat

D)

Take an ordered list, compare the search value to the middle value, if it's higher than the middle take the right side of the list otherwise take the left and repeat

Correct Answer : Option (D) : Take an ordered list, compare the search value to the middle value, if it's higher than the middle take the right side of the list otherwise take the left and repeat

3 .

A technique for direct search is_______

A)

Tree Search

B)

Linear Search

C)

Hashing

D)

Binary Search

Correct Answer : Option (C) : Hashing

4 .

Assume the input array is nearly sorted. Then performance of Quick sort is______

A)

Worst than Average case

B)

Same as in Average case

C)

Better than Average case

D)

None of the above

Correct Answer : Option (A) : Worst than Average case

5 .

What is the time complexity of insertion sort in best case?

A)

O(n2)

B)

O(n)

C)

O(log2n)

D)

O(nlog2n)

Correct Answer : Option (B) : O(n)

6 .

The time factor when determining the efficiency of algorithm is measured by

A)

Counting microseconds

B)

Counting the number of statements

C)

Counting the kilobytes of algorithm

D)

Counting the number of key operations

Correct Answer : Option (D) : Counting the number of key operations

7 .

An hash table with chaining as a collision resolution technique degenerates to a

A)

Tree

B)

Stack

C)

Queue

D)

Linked List

Correct Answer : Option (D) : Linked List

8 .

Which of the following algorithm design technique is used in the quick sort algorithm?

A)

Backtracking

B)

Greedy method

C)

Divide and conquer

D)

Dynamic programming

Correct Answer : Option (C) : Divide and conquer

9 .

Binary Search Method has Worst Case Time Complexity of

A)

log(n)

B)

2n

C)

n*n

D)

nlog(n)

Correct Answer : Option (A) : log(n)

10 .

The average case complexity of Insertion Sort is

A)

O(2n)

B)

O(n2)

C)

O(2n)

D)

O(n3)

Correct Answer : Option (B) : O(n2)