Menu

Question Discussion & Solution

MCQ
Q.
The following are the statements regarding the NP problems. Chose the right option from the following options: I. All NP-complete problems are not NP-hard. II. Some NP-hard problems are not known to be NP-complete.

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 following are the statements regarding the NP problems. Chose the right option from the following options: I. All NP-complete problems are not NP-hard. II. Some NP-hard problems are not known to be NP-complete.
forum Discussion
MCQ
2.
The complexity of merge sort algorithm is _________
forum Discussion
MCQ
3.
The complexity of Binary search algorithm is _________
forum Discussion
MCQ
4.
The term ________ refers to all state space search methods in which all children of the E
forum Discussion
MCQ
5.
The time complexity of the shortest path algorithm can be bounded by
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