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.

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.4k
- Digital Logic 2.1k
- Programming & DS 3.9k
- Algorithms 3.4k
- Theory of Computation 4.2k
- Compiler Design 1.6k
- Databases 3.1k
- CO & Architecture 2.7k
- Computer Networks 3.1k
- Non GATE 1.1k
- Others 1.4k
- Admissions 501
- Exam Queries 449
- Tier 1 Placement Questions 19
- Job Queries 62
- Projects 12

37,996 questions

45,492 answers

131,517 comments

48,591 users