Question Discussion & Solution

MCQ

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;
   }
 }
 }

6n²-14n+4

4n²+6n+12

6n²+14n+10

6n²-14n+10

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

In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do it is expressed by using

Order of magnitude or Big - O

Central tendency

Differential equation

Polynomial equation

Discussion

MCQ

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

f(n) ≤ C*g(n)

f(n) = C*g(n)

f(n) ≥ C*g(n)

f(n) != C*g(n)

Discussion

MCQ

What term is used to describe an O(n) algorithm?

Constant

Non Polynomial Deterministic

Logarithmic

Linear

Discussion

MCQ

O(2^n) means computing time is __________________

Constant

Quadratic

Linear

Exponential

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