Menu

Question Discussion & Solution

MCQ

Q.

The time complexity of the shortest path algorithm can be bounded by

A

O(n2)

B

O(n4)

C

O(n3)

D

O(n)

E

O(n log n ).

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

The complexity of Bubble sort algorithm is _________

A

O(n)

B

O(log n)

C

O(n²)

D

O(n log n)

Discussion

MCQ

2.

The time taken by NP-class sorting algorithm is

A

O(1)

B

O(log n)

C

O(n2)

D

O(n)

Discussion

MCQ

3.

A problem L is NP-complete iff L is NP-hard and

A

L ? NP

B

L ? NP

C

L ? NP

D

L = NP

Discussion

MCQ

4.

The complexity of Binary search algorithm is _________

A

O(n)

B

O(log)

C

O(n²)

D

O(n log n)

Discussion

MCQ

5.

Choose the correct answer for the following statements:

I. The theory of NP

A

I is FALSE and II is TRUE

B

I is TRUE and II is FALSE

C

Both are TRUE

D

Both are FALSE

Discussion

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

76 MCQs

Asymptotic Notation

38 MCQs

Divide and Conquer Strategy

18 MCQs

Sorting

14 MCQs

Linear Time Sorting

8 MCQs

Dynamic Programming

18 MCQs

Greedy Algorithms

10 MCQs

Backtracking Algorithms

13 MCQs

Graphs

18 MCQs

Complexity Theory

11 MCQs