GATE CS 2020 (Forenoon) — Question 17

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ1 mark · −1/3 if wrongMedium

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1's?
  1. A
    \( ((0 + 1)^* 1(0 + 1)^*1)^*10^* \)
  2. B
    \( (0^*10^*10^*)^*0^*1 \)
  3. C
    \( 10^* (0^*10^*10^*)^* \)
  4. D
    \( (0^*10^*10^*)^*10^* \)
Practise the full 2020-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group