Computer Science MCQs (Set–25 | 500-Level Research-Oriented Complexity ๐๐ฅ)
- Get link
- X
- Other Apps
241. If coNP ⊆ NP, then which major collapse follows?
A) P = NP
B) PH collapses to NP
C) PSPACE = NP
D) EXPTIME = NP
Answer: B) PH collapses to NP
242. The language TRUE quantified Boolean formulas with k alternations is complete for:
A) NP
B) coNP
C) ฮฃโ^P
D) PSPACE
Answer: C) ฮฃโ^P
243. Ladner’s Theorem states that if P ≠ NP, then:
A) NP-Complete problems do not exist
B) There exist NP-intermediate problems
C) PH collapses
D) PSPACE = NP
Answer: B) There exist NP-intermediate problems
244. The class IP (Interactive Polynomial time) is equal to:
A) NP
B) coNP
C) PSPACE
D) EXPTIME
Answer: C) PSPACE
245. Which of the following is known about NL and coNL?
A) NL ≠ coNL
B) NL ⊆ coNL
C) NL = coNL
D) Unknown
Answer: C) NL = coNL
246. If NP = P, then which of the following becomes true?
A) Every language in NP has polynomial-size circuits
B) PH collapses to P
C) NP = coNP
D) All of the above
Answer: D) All of the above
247. The problem of determining whether a Turing Machine accepts infinitely many strings is:
A) Decidable
B) Undecidable
C) NP-Complete
D) PSPACE-Complete
Answer: B) Undecidable
248. Which of the following is complete for EXPTIME?
A) Generalized Chess
B) 3-SAT
C) Graph Coloring
D) QBF
Answer: A) Generalized Chess
249. The circuit minimization problem is:
A) Known NP-Complete
B) Known in P
C) Believed hard, exact complexity unknown
D) PSPACE-Complete
Answer: C) Believed hard, exact complexity unknown
250. MIP (Multi-prover Interactive Proofs) is equal to:
A) NP
B) PSPACE
C) NEXP
D) EXPTIME
Answer: C) NEXP
- Get link
- X
- Other Apps
Comments
Post a Comment