The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+5 votes

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:

Which of the following problems is not $NP$-hard?

- Hamiltonian circuit problem
- The $0/1$ Knapsack problem
- Finding bi-connected components of a graph
- The graph coloring problem

+11 votes

Best answer

- Is NPC and hence NP hard.
- Is again NP hard (optimization version is NP hard and decision version is NPC). Ref: http://stackoverflow.com/questions/3907545/how-to-understand-the-knapsack-problem-is-np-complete
- Is in P. See the algorithm here based on DFS: http://en.wikipedia.org/wiki/Biconnected_component
- NPC and hence NP hard.

Correct Answer: $C$

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.3k
- Digital Logic 2.9k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6k
- Compiler Design 2k
- Databases 4.1k
- CO & Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.4k
- Admissions 596
- Exam Queries 577
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

49,530 questions

54,139 answers

187,354 comments

71,068 users