GATE CS 2020 Set 1 — Question 17

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+1 / -0.33EasyRegular ExpressionsFinite Automata & Regular LanguagesTheory of Computation

Theory of Computation → Finite Automata & Regular Languages → Regular Expressions

Last updated

Question

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((0+1)^*1(0+1)^*1)^*10^*
  2. B.
    (01010)01(0^*10^*10^*)^*0^*1
  3. C.
    10(01010)10^*(0^*10^*10^*)^*
  4. D.
    (01010)10(0^*10^*10^*)^*10^*

Answer checking is unavailable for this question. You can review the published solution without a score.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Finite Automata & Regular Languages