Question Discussion & Solution

MCQ

The functions f & g are non-negative functions. The function f(n)=Ω(g(n)) if and only if there exist positive constants c & n0 such that ___________ for all n, n≥ n0

f(n) ≤ C*g(n)

f(n) = C*g(n)

f(n) ≥ C*g(n)

f(n) != C*g(n)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The mathematical definition for Omega can be defined as, provided f,g:N→R+ and c is a positive constant and n > n0,

f(n) ≥ c. g(n) n

f(n) = c. g(n) n

f(n) ≥ c + g(n) n

f(n) = c + g(n) n

Discussion

MCQ

If f,t: N→ R+, then t (n) ∈ Ω (f (n)), iff f(n) ∈ O (t (n)) is known as

Limit rule

Rule of inference

Duality rule

Rule of consequences

Discussion

MCQ

The functions f & g are non-negative functions. The function f(n)=θ(g(n)) if and only if there exist positive constants c1,c2 & n0 such that ________for all n, n≥ n0

C2*g(n)≤ f(n) ≤ C1*g(n)

C2*g(n)≥ f(n) = C1*g(n)

C2*g(n)!= f(n) = C1*g(n)

C2*g(n)≤ f(n) = C1*g(n)

Discussion

MCQ

In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do it is expressed by using

Order of magnitude or Big - O

Central tendency

Differential equation

Polynomial equation

Discussion

MCQ

__________ is the maximum number of steps that can executed for the given parameters

Average case

Worst case

Time complexity

Best case

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics