Learn with Anil · TGPSC HMWSSB Manager (Engineering) PYQsPractise online →Subscribe ₹149

TGPSC HMWSSB Manager 2015 Paper 2 CSE · Question 66

Question 66 of the TSPSC Manager (Engineering), HMWSSB, 2015: Paper 2 (Computer Science & Information Technology) (1 November 2015). Try it first, then open the answer. The explanation is in the practice app with the All-in-One Pass.

  1. Manager 2015 Paper 2 (CS & IT) · Q66 · Theory of Computation & Compilers · Regular Languages & Finite Automata

    The language represented by the regular expression 1*01* + 1* + 1*01*01* is

    1. All strings over {0,1} which contains exactly one zero
    2. All strings over {0,1} which contain at least two zeros.
    3. All strings over {0,1} which contain at most two zeros
    4. All strings over {0,1} containing exactly two zeros
    Show answer

    Answer: (3) All strings over {0,1} which contain at most two zeros

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

Answer it in the practice appMake a topic-wise quiz