Millionaire Mode

Computer Science (UGC/NET)

Question 1 of 15

Which of the following problems is not considered to be in NP-complete?

  1. dominating set problem
  2. vertex cover decision problem
  3. Hamiltonian path problem
  4. subset sum problem
  5. graph isomorphism

Prize Money

15₹7 Crores
14₹1 Crore
13₹50,00,000
12₹25,00,000
11₹12,50,000
10₹6,40,000
9₹3,20,000
8₹1,60,000
7₹80,000
6₹40,000
5₹20,000
4₹10,000
3₹5,000
2₹2,000
1₹1,000