Computer Science MCQs (Set–23 | 350-Level Ultra Theoretical ๐๐ฅ)
- Get link
- X
- Other Apps
221. If EXP = NEXP, which of the following collapses?
A) Polynomial Hierarchy
B) EXPTIME Hierarchy
C) P = NP
D) PSPACE = P
Answer: B) EXPTIME Hierarchy
222. The problem of equivalence of two regular expressions is:
A) NP-Complete
B) PSPACE-Complete
C) Decidable in polynomial time
D) Undecidable
Answer: B) PSPACE-Complete
223. If L is NP-Complete and L ≤T P (Turing reduction), then:
A) P = NP
B) L is undecidable
C) NP ⊆ P
D) PSPACE = NP
Answer: C) NP ⊆ P
224. The complement of a context-free language is guaranteed to be:
A) Context-Free
B) Regular
C) Context-Sensitive
D) Recursively Enumerable only
Answer: C) Context-Sensitive
225. In space complexity, PSPACE is closed under:
A) Complement
B) Union
C) Intersection
D) All of the above
Answer: D) All of the above
226. The problem of determining whether a given Turing Machine halts on all inputs is:
A) Decidable
B) NP-Complete
C) Undecidable
D) PSPACE-Complete
Answer: C) Undecidable
227. If a Boolean formula has n variables, the total possible truth assignments are:
A) n²
B) 2n
C) 2โฟ
D) n!
Answer: C) 2โฟ
228. In approximation complexity, unless P = NP, which problem has no PTAS?
A) Vertex Cover
B) Knapsack
C) Travelling Salesman Problem (metric)
D) Maximum Clique
Answer: D) Maximum Clique
229. In randomized complexity, RP ⊆ NP because:
A) Deterministic simulation
B) Certificate verification
C) Random guessing
D) Complement closure
Answer: B) Certificate verification
230. The deterministic communication complexity of equality problem (n bits) is:
A) O(1)
B) O(log n)
C) O(n)
D) O(n²)
Answer: C) O(n)
- Get link
- X
- Other Apps
Comments
Post a Comment