Computer Science MCQs (Set–31 | Level — Beyond Classical Frontiers ๐Ÿ˜ˆ๐Ÿ”ฅ)

301. The Analytical Hierarchy extends the Arithmetical Hierarchy by allowing quantification over: A) Natural numbers only B) Strings only C) Sets of natural numbers D) Finite automata Answer: C) Sets of natural numbers 302. The problem TOT (set of Turing machines that halt on all inputs) is: A) RE-complete B) coRE-complete C) ฮ ₂⁰-complete D) Decidable Answer: C) ฮ ₂⁰-complete 303. The equality IP = PSPACE was proven by: A) Adi Shamir B) Richard Karp C) Stephen Cook D) John Nash Answer: A) Adi Shamir 304. The PCP Theorem was proven independently by: A) Sanjeev Arora and Shmuel Safra B) Leonid Levin and Michael Rabin C) Andrew Wiles and Terence Tao D) Leslie Valiant and Dana Scott Answer: A) Sanjeev Arora and Shmuel Safra 305. The class AWPP lies between: A) P and NP B) BQP and PP C) PSPACE and EXP D) L and NL Answer: B) BQP and PP 306. The result QIP = PSPACE was shown by: A) Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and John Watrous B) Scott Aaronson alone C) Peter Shor D) Noam N...

Computer Science MCQs (Set–19 | Ultimate Trap Mixed Set ๐Ÿ˜ˆ๐Ÿ”ฅ)

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

Comments

Popular posts from this blog

General Knowledge Questions and Answers

English Grammar MCQs – Set 43 (SSC / Banking / Railway | Full Practice)

Computer Science MCQs (Set–25 | 500-Level Research-Oriented Complexity ๐Ÿ˜ˆ๐Ÿ”ฅ)

Class 9–10 Mathematics Textbooks

เค‡เคคिเคนाเคธ เค•े MCQ (เคญाเค—–12 | 111–120)

General Knowledge Question and Answer (Q&A)

Computer Science MCQs (Set–24 | 400-Level Extreme Proof & Reduction ๐Ÿ”ฅ๐Ÿ˜ˆ)

General Knowledge Question and Answer (Q&A) (51 to 100)

General Knowledge Question and Answer (Q&A)

General Knowledge Question and Answer (Q&A)