Question Discussion & Solution

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

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

O(2^n) means computing time is __________________

Constant

Quadratic

Linear

Exponential

Discussion

MCQ

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

C=5

C=12

C=6

C=11

Discussion

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)

Discussion

MCQ

The function f(n)=o(g(n)) if and only if Limit f(n)/g(n)=0 n->∞

Little oh

Little omega

Big oh

Omega

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