Computer Science MCQs (Set–20 | 200-Level Ultimate Set ๐๐ฅ)
- Get link
- X
- Other Apps
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
- Get link
- X
- Other Apps
Comments
Post a Comment