PGT Computer Science (Level-3), (HTET Practice MCQs) (Part-VI)

Total Questions: 100

81. If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?

Correct Answer: C. O(bᵐ)

82. Let P, Q, R and S be Propositions. Assume that the equivalences P ⇔ (Q v ¬ Q) and Q ⇔ R hold. Then the truth value of the formula (P ∧ Q) ⇒ ((P ∧ R) v S) is always:

Correct Answer: A. True

83. "If X, then Y unless Z is represented by which of the following formulae in propositional logic?

Correct Answer: В. (Х ∧ ¬ Z) → Y

84. Consider the following two well-formed formulas in prepositional logic.

F1 : P ⇒ ¬ P
F2 : (P ⇒ ¬ P) ∨ ( ¬ P ⇒ P)
Which of the following statements is correct?

Correct Answer: A. F1 is Satisfiable, F2 is valid

85. Standard planning algorithms assume environment to be _________ .

Correct Answer: A. Both deterministic and fully observable

86. Which of the following statements is not correct?

Correct Answer: D. Recursive languages are not closed under intersection.

87. Context free grammar is not closed under:

Correct Answer: B. Complementation

88. Consider the following languages:

L₁ = {aᵐ bⁿ | m ≠ n}
L₂ = {aᵐ bⁿ | m = 2n + 1}
L₃ = {aᵐ bⁿ | m ≠  2n}
Which one of the following statement is correct?

Correct Answer: D. L₁, L₂ and L₃ are context free languages

89. A 4 x 4 DFT matrix is given by:

Correct Answer: D. j, -j

90. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by:

Correct Answer: C. the instruction set architecture