Question Discussion & Solution

MCQ

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 ___________

Upper bound

Lower bound

Duality value

Threshold value

Maximum value.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

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

Time Complexity

Input

Space Complexity

Finiteness

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)=O(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

Express the formula (n – 2)*(n – 4) using θ notation:

θ (n^2)

θ (8)

θ (log n)

θ (n)

Discussion

MCQ

Time complexity of given algorithm

 Algorithm Display (A)
 { 
 For I:=0 to n-1 
   { 
    For J:=0 to n-1 { Write A; }
    }
  }

2n^2+4n+4

2n^2+n

2n^2+4n+2

2n^2-1

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