Menu

Question Discussion & Solution

MCQ
Q.
O(2^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.
Worst case efficiency of which search is O(n)?
forum Discussion
MCQ
2.
If f,t: N→ R+, then t (n) ∈ Ω (f (n)), iff f(n) ∈ O (t (n)) is known as
forum Discussion
MCQ
3.
Express the formula (n – 2)*(n – 4) using θ notation:
forum Discussion
MCQ
4.
When we say an algorithm has a time complexity of O (n), what does it mean?
forum Discussion
MCQ
5.
O(n^3) means computing time is __________________
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