Which one of the following regular expressions represents the set of all binary strings with an odd number of 1's?

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) 1*+(1*01*0)*1*
  4. d) None

From the Janata Bank Assistant Network Engineer 2020 – Written exam, question 33 of 68.

More from this paper