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

Total Questions: 100

11. The grammar with production rules

Correct Answer: A.

12. Solve the question?

Correct Answer: C. both s1 and s2

13. For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to

Correct Answer: D. ΙwΙ³

14. Match the following:

  List A (Grammar/Language)  List B (Properties/Automata)
 (a) Context sensitive language (i) Deterministic finite automation
 (b) Regular grammar (ii) Recursive enumerable
 (c) Context free grammar (iii) Recursive language
 (d) Unrestricted grammar (iv) Pushdown auto-mation

Codes:

 Option (a) (b) (c) (d)
 A.  (ii) (i) (iv) (iii)
 B. (iii) (iv) (i) (ii)
 C. (iii) (i) (iv) (ii)
 D. (ii) (iv) (i) (iii)
Correct Answer: C.

15. The statements s1 and s2 are given as:

s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism
s2: Context free languages are closed under comple-mentation, substitution and homomorphism
Which of the following is correct statement?

Correct Answer: B. s1 is correct and s2 is not correct.

16. Which one of the following is not an addressing mode?

Correct Answer: C. Relative indexed

17. Computers can have instruction formats with

Correct Answer: D. zero address, one address, two address and three address instruction

18. Which is not a typical program control instruction?

Correct Answer: C. SHL

19. Interrupt which arises from illegal or erroneous use of an instruction or data is

Correct Answer: B. Internal interrupt

20. The simplified function in product of sums of Boolean function F(W, X,Y, Ζ) = Σ (0, 1, 2, 5, 8, 9, 10) is

Correct Answer: A. (W'+X') (Y'+ Z') (X'+ Z)