Menu

Question Discussion & Solution

MCQ
Q.
Time complexity of given algorithm 

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

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Express the formula (n – 2)*(n – 4) using θ notation:
forum Discussion
MCQ
2.
O(n) means computing time is __________________
forum Discussion
MCQ
3.
O(1) means computing time is __________________
forum Discussion
MCQ
4.
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 ___________
forum Discussion
MCQ
5.
Time complexity of given algorithm

 Algorithm Display(A) 
{ 
S:=0.0;
 For i:=0 to n-1 
{ 
S:=S+A[i];
 Return S; 
} 
}
forum Discussion

category More Design and Analysis of Algorithms Topics

article

Design and Analysis of Algorithms Basics

format_list_bulleted 76 MCQs
article

Asymptotic Notation

format_list_bulleted 38 MCQs
article

Divide and Conquer Strategy

format_list_bulleted 18 MCQs
article

Sorting

format_list_bulleted 14 MCQs
article

Linear Time Sorting

format_list_bulleted 8 MCQs
article

Dynamic Programming

format_list_bulleted 18 MCQs
article

Greedy Algorithms

format_list_bulleted 10 MCQs
article

Backtracking Algorithms

format_list_bulleted 13 MCQs
article

Graphs

format_list_bulleted 18 MCQs
article

Complexity Theory

format_list_bulleted 11 MCQs