Menu

Question Discussion & Solution

MCQ
Q.
When we say an algorithm has a time complexity of O (n), what does it mean?

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 asymptotic notation for defining the average time complexity is
forum Discussion
MCQ
2.
Performance based criteria of algorithm , which has to do with its computing time is _______________
forum Discussion
MCQ
3.
Performance based criteria of algorithm , which has to do with its storage requirements is _______________
forum Discussion
MCQ
4.
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
MCQ
5.
__________ is the average number of steps that can executed for the given parameters
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