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

Total Questions: 100

61. A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.

Correct Answer: D. 3¹⁰⁰

62. Which of the following connected simple graph has exactly one spanning tree?

Correct Answer: D. None of the above

63. How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?

Correct Answer: C. M - N + C

64. Which of the following shall be a compound proposition involving the proposition p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise?

Correct Answer: C.

65. The truth value of the statments:

Correct Answer: D. True and True

66. How many different Boolean functions of degree 4 are there?

Correct Answer: D. 2¹⁶

67. Solve this question?

Correct Answer: B. Always true

68. Which one of the following is decimal value of a signed binary number 1101010, if it is in 2's complement form?

Correct Answer: B. -22

69. A set of processors P1, P2,......., Pk can execute in parallel if Bernstein's conditions are satisfied on a pairwise basis; that is

Correct Answer: A.

70. When a mobile telephone physically moves from one to another cell, the base station transfers onwership to the cell getting strongest signal. This process is known as ____________ .

Correct Answer: A. handoff