Menu

Question Discussion & Solution

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

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.
Performance based criteria of algorithm , which has to do with its storage requirements is _______________
forum Discussion
MCQ
2.
Performance based criteria of algorithm , which has to do with its computing time is _______________
forum Discussion
MCQ
3.
__________ is the average number of steps that can executed for the given parameters
forum Discussion
MCQ
4.
The functions f & g are non-negative functions. The function f(n)=O(g(n)) if and only if there exist positive constants c & n0 such that __________ for all n, n≥ n0
forum Discussion
MCQ
5.
The mathematical definition for Omega can be defined as, provided f,g:N→R+ and c is a positive constant and n > n0,
forum Discussion

category More Design and Analysis of Algorithms Topics

article

Design and Analysis of Algorithms Basics

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Asymptotic Notation

format_list_bulleted 38 MCQs
Practice arrow_forward
article

Divide and Conquer Strategy

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Sorting

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Linear Time Sorting

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Dynamic Programming

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Greedy Algorithms

format_list_bulleted 10 MCQs
Practice arrow_forward
article

Backtracking Algorithms

format_list_bulleted 13 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Complexity Theory

format_list_bulleted 11 MCQs
Practice arrow_forward