Question Discussion & Solution

MCQ

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

Space complexity

Worst case

Time complexity

Best case

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

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

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

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

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

f (n) ∈Ω(g(n)), and g(n) ∈ Ω (f(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

MCQ

Read the following statements carefully, and choose the correct answer. I. The ? notation is Anti Symmetric. II. The big Oh notation is Semi Equivalence.

(I) is FALSE but (II) is TRUE

Both (I), (II) are TRUE

(I) is TRUE but(II) is FALSE

Both (I), (II) are FALSE

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

__________ is the average 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