Computer Science MCQs (Set–16 | Ultimate Challenge – PhD Level ๐๐ฅ)
- Get link
- X
- Other Apps
151. If P = NP, which of the following would immediately follow?
A) All undecidable problems become decidable
B) All NP-Complete problems can be solved in polynomial time
C) PSPACE = EXPTIME
D) Halting problem becomes solvable
Answer: B) All NP-Complete problems can be solved in polynomial time
152. The complement of a recursive language is:
A) Recursive
B) Recursively Enumerable only
C) Not decidable
D) Context-Free
Answer: A) Recursive
153. A language is recursively enumerable but not recursive if and only if:
A) Both L and L̅ are RE
B) Neither L nor L̅ are RE
C) L is RE but L̅ is not RE
D) L is regular
Answer: C) L is RE but L̅ is not RE
154. In parameterized complexity, FPT stands for:
A) Fully Polynomial Time
B) Fixed Parameter Tractable
C) Fast Polynomial Theorem
D) Finite Processing Time
Answer: B) Fixed Parameter Tractable
155. The communication complexity of equality problem with deterministic protocol (n-bit input) is:
A) O(1)
B) O(log n)
C) O(n)
D) O(n²)
Answer: C) O(n)
156. In randomised algorithms, Monte Carlo algorithms:
A) Always give correct result
B) May give incorrect result with bounded probability
C) Never terminate
D) Are deterministic
Answer: B) May give incorrect result with bounded probability
157. The VC-dimension of a linear classifier in 2D is:
A) 2
B) 3
C) 4
D) Infinite
Answer: B) 3
158. In cryptography, a one-way function is:
A) Easily invertible
B) Hard to compute
C) Easy to compute but hard to invert
D) Symmetric encryption
Answer: C) Easy to compute but hard to invert
159. If NP ⊆ P/poly, then:
A) P = NP
B) Polynomial hierarchy collapses
C) PSPACE = NP
D) EXP = NP
Answer: B) Polynomial hierarchy collapses
160. In quantum computing, Shor’s algorithm solves:
A) Search problem
B) Graph coloring
C) Integer factorization in polynomial time
D) Sorting
Answer: C) Integer factorization in polynomial time
- Get link
- X
- Other Apps
Comments
Post a Comment