Menu

Question Discussion & Solution

MCQ
Q.
O(n^2) means computing time is __________________

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.
What term is used to describe an O(n) algorithm?
forum Discussion
MCQ
2.
Time complexity of given algorithm 

Algorithm:

Sum(A,S) 
{ 
for i:=1 to n-1 
{ 
for j:=2 to n-1
 { 
 S:=S+i+j;
  return S;
   }
 }
 }
forum Discussion
MCQ
3.
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
forum Discussion
MCQ
4.
When we say an algorithm has a time complexity of O (n), what does it mean?
forum Discussion
MCQ
5.
Worst case efficiency of which search is O(n)?
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