Monday, 11 September 2017

HSST CS QP 2011 - Part 6



Posted by at

2 comments:

  1. Teach to Triumph12 September 2017 at 16:39

    Answers

    82. A, B & D
    83. A
    84. B
    85. B
    86. A, B, C
    87. A
    88. B
    89. A
    90. C
    91. B
    92. C
    93. C
    94. A
    95. D
    96. C
    97. D
    98. C
    99. John Vincent Atanasoff
    100. C

    ReplyDelete
  2. Teach to Triumph12 September 2017 at 16:40

    82. Explanation:

    Recursively enumerable languages are closed under union, intersection, concatenation and Kleene star operations.

    ReplyDelete

Subscribe to: Post Comments (Atom)