UTpaper

Free mock tests & test series

Question 112Asked in CIL MT Systems, 26 Mar 2017 (12:30 PM)

Which of the following is an NP-complete problem?

  1. ATuring's Halting problem
  2. BCNF-Satisfiability problem
  3. CPresburger Arithmetic problem
  4. DNumber of Hamiltonian circuits in a complete graph of 'n' vertices with n > 2
Show answerHide answer

Correct answer: (B) CNF-Satisfiability problem

From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)

This is question 112 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.