Question 1 |

Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string \epsilon is divisible by three.

**[MSQ]**(0+1(01^*0)^*1)^* | |

(0+11+10(1+00)^*01)^* | |

(0^*(1(01^*0)^*1)^*)^* | |

(0+11+11(1+00)^*00)^* |

Question 1 Explanation:

Question 2 |

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

((0+1)^* 1(0+1)^*1)^*10^* | |

(0^*10^*10^*)^*0^*1 | |

10^*(0^*10^*10^*)^* | |

(0^*10^*10^*)^*10^* |

Question 2 Explanation:

Question 3 |

In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denote the sets of letters and digits respectively, which of the following expressions defines an identifier?

(L+D)^{+} | |

\text { (L.D)* } | |

L(L+D)^{*} | |

L(L . D)^{*} |

Question 3 Explanation:

Question 4 |

Let L=\left\{w \in(0+1)^{*} \mid w \text { has even number of } 1 \text { 's }\right\}, i.e. L is the set of all bit strings with even number of 1's. Which one of the regular expression below represents L?

(0^*10^*1)^* | |

0^*(10^*10^*)^* | |

0^*(10^*1^*)^*0^* | |

0^*1(10^*1)^*10^* |

Question 4 Explanation:

Question 5 |

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

(0+1)*0011(0+1)*+(0+1)*1100(0+1)* | |

(0+1)*(00(0+1)*11+11(0+1)*00)(0+1)* | |

(0+1)*00(0+1)*+(0+1)*11(0+1)* | |

00(0+1)*11+11(0+1)*00 |

Question 5 Explanation:

Question 6 |

The length of the shortest string NOT in the language (over \Sigma={a,b}) of the following regular expression is _________.

a*b* (ba)* a*

a*b* (ba)* a*

1 | |

2 | |

3 | |

4 |

Question 6 Explanation:

Question 7 |

Let L = {w \in (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings
with even number of 1s. Which one of the regular expressions below represents L?

(0 *10 *1) * | |

0 * (10 *10 *) * | |

0 * (10 *1) * 0 * | |

0 *1(10 *1) *10 * |

Question 7 Explanation:

Question 8 |

Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

The set of all strings containing the substring 00. | |

The set of all strings containing at most two 0's. | |

The set of all strings containing at least two 0's. | |

The set of all strings that begin and end with either 0 or 1 |

Question 8 Explanation:

Question 9 |

Which of the following regular expressions describes the language over\{0, 1\} consisting of strings that contain exactly two 1's?

(0 + 1)^ * \ 11(0 + 1) ^* | |

0 ^* \ 110 ^* | |

0 ^* 10 ^* 10 ^* | |

(0 + 1) ^* 1(0 + 1) ^* 1 (0 + 1) ^* |

Question 9 Explanation:

Question 10 |

Consider the regular expression R = (a + b)^* \ (aa + bb) \ (a + b)^*

Which one of the regular expressions given below defines the same language as defined by the regular expression R ?

Which one of the regular expressions given below defines the same language as defined by the regular expression R ?

(a(ba)^* + b(ab)^*)(a + b)^+ | |

(a(ba)^* + b(ab)^*)^*(a + b)^* | |

(a(ba)^* (a + bb) + b(ab)^*(b + aa))(a + b)^* | |

(a(ba)^* (a + bb) + b(ab)^*(b + aa))(a + b)^+ |

Question 10 Explanation:

There are 10 questions to complete.

Options wrong

Please specify the question number and option which you fell as wrong.

7th C option is wrong

Thank You shivam,

We have updated the option C.

Useful.Thank you

Q11 options A and B don’t have a final state.

Thank You,

We have updated the figure as per your suggestion.