Computer Science MCQs (Set–19 | Ultimate Trap Mixed Set ๐๐ฅ)
- Get link
- X
- Other Apps
181. If P ≠ NP, which of the following is definitely true?
A) No NP-Complete problem is in P
B) Some NP problems are not in P
C) All NP problems are undecidable
D) NP = co-NP
Answer: B) Some NP problems are not in P
182. The language { aโฟ bโฟ cโฟ dโฟ | n ≥ 0 } is:
A) Regular
B) Context-Free
C) Context-Sensitive
D) Recursively Enumerable only
Answer: C) Context-Sensitive
183. In randomized algorithms, Las Vegas algorithms:
A) Always give correct answer but runtime may vary
B) May give incorrect answer
C) Never terminate
D) Are deterministic
Answer: A) Always give correct answer but runtime may vary
184. In graph theory, a tree with n vertices has exactly:
A) n edges
B) n − 1 edges
C) n + 1 edges
D) n² edges
Answer: B) n − 1 edges
185. If A is NP-Complete and A ≤p B, then B is:
A) In P
B) NP-Complete
C) NP-Hard
D) Recursive
Answer: C) NP-Hard
186. In memory hierarchy, the fastest memory is:
A) RAM
B) Cache
C) Register
D) Hard Disk
Answer: C) Register
187. The maximum number of leaves in a binary tree of height h (root at height 0) is:
A) 2^h
B) 2^(h+1)
C) 2^(h−1)
D) h²
Answer: A) 2^h
188. In consensus protocols, Byzantine Fault Tolerance requires minimum nodes:
A) 2f
B) 2f + 1
C) 3f + 1
D) 4f
Answer: C) 3f + 1
189. In Big-Omega notation, f(n) = ฮฉ(g(n)) means:
A) f grows no faster than g
B) f grows at least as fast as g
C) f and g same growth always
D) f < g for large n
Answer: B) f grows at least as fast as g
190. The class EXPTIME contains problems solvable in:
A) Polynomial time
B) Logarithmic time
C) Exponential time
D) Constant time
Answer: C) Exponential time
- Get link
- X
- Other Apps
Comments
Post a Comment