Which of the following problems is not NP-complete? - Practice (English) | ObjectiveMcq

Loading practice questions

A focused practice platform for competitive-exam MCQs, subject wise, topic wise practice, and current affairs revision.

Exams

SSC CGL
UPSC CSE PRELIMS
IBPS PO
RRB NTPC
CDS

Subjects

Mathematics
Physics
General Knowledge
English
Reasoning

Resources

Current Affairs
Search MCQs
Practice Sets

Company

About Us
Contact
Privacy Policy
Terms of Use
Disclaimer
Copyright

Practice library for exams, subjects, and daily revision. For learning purposes only.

© 2026 ObjectiveMcq.ComAll rights reserved

Which of the following problems is not NP-complete? - Practice (English) | ObjectiveMcq

PracticeData Structure And AlgorithmComplexity ClassesWhich of the following problems is ...

Complexity Classes Data Structure And AlgorithmMedium

744 views

Which of the following problems is not NP-complete?

Correct Answer: D — Halting problem

Explanation:

Hamiltonian circuit, bin packing, and partition problems are NP-complete. The Halting problem is undecidable — it cannot be solved by any algorithm at all.

Related Practice

How many constraints does flow have?
What is the running time of Dinic's blocking flow algorithm?
Who formulated the Maximum flow problem?
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
Dinic's algorithm runs faster than the Ford-Fulkerson algorithm.
In what time can an augmenting path be found?
A simple acyclic path between source and sink which passes through only positive weighted edges is called?
Under what condition can a vertex combine and distribute flow in any manner?