Menu

Question Discussion & Solution

MCQ
Q.
O(n) 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.
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
2.
__________ is the average number of steps that can executed for the given parameters
forum Discussion
MCQ
3.
Given two non-negative functions f(n)= 5n2+6n+1 and g(n)=n2 . Calculate upper bound value ,C
forum Discussion
MCQ
4.
Tight bound is denoted as _______
forum Discussion
MCQ
5.
Read the following statements carefully, and choose the correct answer. I. The ? notation is Anti Symmetric. II. The big Oh notation is Semi Equivalence.
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