Design and Analysis of Algorithms Basics Questions

MCQ bookmark_border

1.

Two main measures for the efficiency of an algorithm are

A

Processor and memory

B

Complexity and capacity

C

Time and space

D

Data and space

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

2.

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

A

Counting microseconds

B

Counting the number of key operations

C

Counting the number of statements

D

Counting the kilobytes of algorithm

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

3.

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

A

Counting the maximum memory needed by the algorithm

B

Counting the minimum memory needed by the algorithm

C

Counting the average memory needed by the algorithm

D

Counting the maximum disk space needed by the algorithm

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

4.

Which of the following case does not exist in complexity theory

A

Best case

B

Worst case

C

Average case

D

Null case

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

5.

The Worst case occur in linear search algorithm when

A

Item is somewhere in the middle of the array

B

Item is not in the array at all

C

Item is the last element in the array

D

Item is the last element in the array or is not there at all

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

6.

The Average case occur in linear search algorithm

A

When Item is somewhere in the middle of the array

B

When Item is not in the array at all

C

When Item is the last element in the array

D

When Item is the last element in the array or is not there at all

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

The complexity of linear search algorithm is

A

O(n)

B

O(log n)

C

O(n^2)

D

O(n log n)

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

8.

The upper bound on the time complexity of the nondeterministic sorting algorithm is

A

O(n)

B

O(n log n)

C

O(1)

D

O( log n)

E

O(n^2).

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

9.

The worst case time complexity of the nondeterministic dynamic knapsack algorithm is

A

O(n log n)

B

O( log n)

C

O(n^2)

D

O(n)

E

O(1).

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

What do you call the selected keys in the quick sort method?

A

Outer key

B

Inner Key

C

Partition key

D

Pivot key

E

Recombine key.

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion