Regular Expressions Questions

MCQ bookmark_border

11.

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)*?

A

strings with the substring 00

B

strings with at most two 0

C

strings with at least two 0

D

strings beginning and ending with either 0 or 1

Correct Answer: C

strings with at least two 0

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

12.

Match the following
Group 1 Group 2P. Regular expression 1. Syntax analysis

Q. Pushdown automata 2. Code generation

R. Dataflow analysis 3. Lexical analysis

S. Register allocation 4. Code optimization

A

P-4. Q-1, R-2, S-3

B

P-3, Q-1, R-4, S-2

C

P-3, Q-4, R-1, S-2

D

P-2, Q-1, R-4, S-3

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

13.

Let L = L1 ? L2, where L1 and L2 are languages as defined below:
L1 = {ambmcanbn | m, n >= 0 }

L2 = {aibjck | i, j, k >= 0 }

Then L is

A

Not recursive

B

Regular

C

Context free but not regular

D

None of the mentioned

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

14.

Does epsilon ring any change in the automata

A

Yes

B

No

C

May be

D

Can't say

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

15.

NFA-?s are defined because certain properties can be more easily proved on them as compared to NFA.

A

True

B

False

C

May be

D

Can't say

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

16.

NFA-?s are defined because certain properties can be more easily proved on them as compared to NFA.

A

True

B

False

C

May be

D

Can't say

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

17.

E(q) is known ?-closure of q.

A

True

B

False

C

May be

D

Can't say

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

18.

?-transitions does not add any extra capacity of recognizing formal

A

True

B

False

C

May be

D

Can't say

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

19.

A nondeterministic finite automaton with ?-moves is an extension of nondeterministic finite automaton

A

True

B

False

C

May be

D

Can't say

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

20.

Is an ordinary NFA and a NFA-? are equivalent

A

True

B

False

C

May be

D

Can't say

Correct Answer: A

Check Answer report_problem Report forum Discussion