GATE Computer Science (CS) 2016 Shift 1 Solved Paper

Question : 28 of 65

Marks: +1, -0

Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive 0s and two consecutive 1s?