Question Discussion & Solution

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

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

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

Average case

Worst case

Time complexity

Best case

Discussion

MCQ

O(n) means computing time is __________________

Constant

Quadratic

Linear

Cubic

Discussion

MCQ

O(1) means computing time is __________________

Constant

Quadratic

Linear

Cubic

Discussion

MCQ

Performance based criteria of algorithm , which has to do with its storage requirements is _______________

Time Complexity

Input

Space Complexity

Finiteness

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