Menu

Question Discussion & Solution

MCQ

Q.

Let f, t: N→R ≥ 0, and t (n) ∈O (f (n)) iff t(n)≤ c.f (n) where cis positive real constant and n≥ no, then no is ___________

A

Upper bound

B

Lower bound

C

Duality value

D

Threshold value

E

Maximum value.

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.

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

A

Sequential search

B

Binary search

C

Indexed search

D

Hashing

Discussion

MCQ

2.

The amount of memory needs to run to completion is known as_____________

A

Space complexity

B

Worst case

C

Time complexity

D

Best case

Discussion

MCQ

3.

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

A

C=5

B

C=12

C

C=6

D

C=11

Discussion

MCQ

4.

For defining the best time complexity, let f (n) = log n and g (n) = √n,

A

f (n) ∈Ω(g(n)), but g(n) ∉ Ω (f(n))

B

f (n) ∉Ω(g(n)), but g(n) ∈ Ω (f(n))

C

f (n) ∉Ω(g(n)), and g(n) ∉ Ω (f(n))

D

f (n) ∈Ω(g(n)), and g(n) ∈ Ω (f(n))

Discussion

MCQ

5.

Upper bound is denoted as _______

A

Ω

B

Θ

C

ω

D

O

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