PGT Computer Science (Level-3), (HTET Practice MCQs) (Part-II)Total Questions: 10041. In _____________ substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text.A. polyalphabeticB. monoalphabeticC. transpositionalD. multialphabeticCorrect Answer: B. monoalphabetic42. In classful addressing, the IP address 190.255.254.254 belongs toA. Class AB. Class BC. Class CD. Class DCorrect Answer: B. Class B43. In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three-layer hierarchy?A. 10 clusters, 24 regions and 20 routersB. 12 clusters, 20 regions and 20 routersC. 16 clusters, 12 regions and 25 routersD. 15 clusters, 16 regions and 20 routersCorrect Answer: D. 15 clusters, 16 regions and 20 routers44. In IPV₄ header, the ___________ field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs toA. identificationB. fragment offsetC. time to liveD. header checksumCorrect Answer: A. identification45. Given L1 = L (a*baa*) and L2 = L(ab*). The regular expression corresponding to language 1.3 = LI/L2 (right quotient) is given byA. a*bB. a*baа*C. a*ba*D. None of the aboveCorrect Answer: C. a*ba*46. Given the production rules of a grammar G1 asS₁ → AB | aaB A → a | Aa B → b and the production rules of a grammar G2 as S₂ → aS₂bS₂ | bS₂aS₂ | λ Which of the following is correct statement?A. G1 is ambiguous and G2 is not ambiguous.B. G1 is ambiguous and G2 is ambiguous.C. G1 is not ambiguous and G2 is ambiguous.D. G1 is not ambiguous and G2 is not ambiguous.Correct Answer: B. G1 is ambiguous and G2 is ambiguous.47. Given a grammar:S1 → Sc, S → SA | A, A → aSb | ab, there is a rightmost derivation S1 ⇒ Sc ⇒ SAC SaSbc Thus, SaSbc is a right sentential form, and its handle isA. SaSB. bcC. SbcD. aSbCorrect Answer: D. aSb48. The equivalent production rules corresponding to the production rulesA.B.C.D.Correct Answer: D.49. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below: The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA isA. 5B. 4C. 3D. 2Correct Answer: C. 350. Which is the correct statement(s) for Non-Recursive predictive parser?A. Both statements S1 and S2 are incorrectB. S1 is incorrect and S2 is correctC. S1 is correct and S2 is incorrectD. Both statements S1 and S2 are correctCorrect Answer: D. Both statements S1 and S2 are correctSubmit Quiz« Previous12345678910Next »