Computer Science MCQs (Set–29 | Level — Frontier Open Conjectures & Deep Structural Theory ๐Ÿ˜ˆ๐Ÿ”ฅ)

281. The statement “P ≠ NP” would immediately imply: A) NP ⊄ P B) No NP-Complete problem is solvable in polynomial time C) There exist problems verifiable but not efficiently solvable D) All of the above Answer: D) All of the above 282. The class coNP consists of languages whose complements are in: A) P B) NP C) PSPACE D) EXP Answer: B) NP 283. If PH collapses to level k, then: A) All higher levels equal ฮฃโ‚–^P B) PSPACE collapses C) NP = PSPACE D) EXP collapses Answer: A) All higher levels equal ฮฃโ‚–^P 284. The problem of graph isomorphism is currently known to be in: A) P (proven decades ago) B) NP-Complete C) Quasi-polynomial time D) PSPACE-Complete Answer: C) Quasi-polynomial time 285. The class #P deals with: A) Optimization problems B) Counting accepting paths C) Space-bounded computation D) Quantum proofs Answer: B) Counting accepting paths 286. If #P = FP (polynomial-time computable functions), then: A) P = NP B) PH collapses C) PSPACE = NP D) BQP = P Answer: B) PH collapses ...

Computer Science MCQs (Set–20 | 200-Level Ultimate Set ๐Ÿ†๐Ÿ”ฅ)

191. Which of the following statements is TRUE?

A) P ⊆ NP
B) NP ⊆ P
C) P ⊂ NP is proven
D) NP ⊂ P is proven

Answer: A) P ⊆ NP


192. The language of all palindromes over {0,1} is:

A) Regular
B) Context-Free
C) Context-Sensitive only
D) Not decidable

Answer: B) Context-Free


193. In a graph with V vertices and E edges, using adjacency list representation, BFS time complexity is:

A) O(V²)
B) O(E log V)
C) O(V + E)
D) O(V log E)

Answer: C) O(V + E)


194. If a problem is NP-Hard and also in NP, then it is:

A) In P
B) NP-Complete
C) Undecidable
D) PSPACE

Answer: B) NP-Complete


195. In paging, if TLB hit ratio increases, effective access time will:

A) Increase
B) Decrease
C) Remain constant
D) Become infinite

Answer: B) Decrease


196. The pumping lemma for regular languages is used to prove that a language is:

A) Regular
B) Not Regular
C) Context-Free
D) Decidable

Answer: B) Not Regular


197. In a complete binary tree stored in array (0-based index), for a node at index i, left child index is:

A) 2i
B) 2i + 1
C) 2i − 1
D) i/2

Answer: B) 2i + 1


198. A deterministic pushdown automaton (DPDA) recognizes:

A) All CFLs
B) Only Regular languages
C) A subset of CFLs
D) Context-Sensitive languages

Answer: C) A subset of CFLs


199. In Shannon’s information theory, entropy is maximum when:

A) One event has probability 1
B) All events equally likely
C) Two events only
D) Probability is zero

Answer: B) All events equally likely


200. The time hierarchy theorem implies:

A) More time gives no advantage
B) Strict inclusion between time complexity classes
C) P = NP
D) All problems are decidable

Answer: B) Strict inclusion between time complexity classes

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)