Which of the following is known to be not an NP-Hard Problem?

Algorithm - Quiz(MCQ)

Vertex Cover Problem

0/1 Knapsack Problem

Travelling Salesman Problem

Maximal Independent Set Problem

Correct Answer : Option (B) : 0/1 Knapsack Problem

Recently Updated in Algorithm Questions

Q .

External entities in DFD are shown by_________

Circle

Ellipse

Hexagon

Rectangle

Correct Answer : Option (D) : Rectangle

Q .

Assume that we use Bubble Sort to sort n distinct elements in ascending order. When does the best case of Bubble Sort occur?

When elements are sorted in ascending order

When elements are not sorted by any order

When elements are sorted in descending order

There is no best case for Bubble Sort. It always takes O(n*n) time

Correct Answer : Option (A) : When elements are sorted in ascending order