Menu

Question Discussion & Solution

MCQ

Q.

Worst case efficiency of which search is O(n)?

A

Sequential search

B

Binary search

C

Indexed search

D

Hashing

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.

Performance based criteria of algorithm , which has to do with its computing time is _______________

A

Time Complexity

B

Input

C

Space Complexity

D

Finiteness

Discussion

MCQ

2.

O(1) means computing time is __________________

A

Constant

B

Quadratic

C

Linear

D

Cubic

Discussion

MCQ

3.

Given two non-negative functions f(n)= 5n²+6n+1 and g(n)=n² . Calculate upper bound value ,C

A

C=5

B

C=12

C

C=6

D

C=11

Discussion

MCQ

4.

The θ notation is

A

Symmetric

B

Reflexive

C

Transitive

D

(a), (b) and (c) above.

Discussion

MCQ

5.

The asymptotic notation for defining the average time complexity is

A

Equivalence

B

Symmetric

C

Reflexive

D

Both (c) and (d) above.

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