adplus-dvertising

Welcome to the Theory of Computation(TOC) MCQs Page

Dive deep into the fascinating world of Theory of Computation(TOC) with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Theory of Computation(TOC), a crucial aspect of GATE CSE Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Theory of Computation(TOC), from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within GATE CSE Exam.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Theory of Computation(TOC). Test your knowledge, expand your horizons, and solidify your grasp on this vital area of GATE CSE Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Theory of Computation(TOC). You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Theory of Computation(TOC) MCQs | Page 8 of 14

Q71.
Match the following NFAs with the regular expressions they correspond to

1. ϵ + 0(01*1 + 00) * 01*
2. ϵ + 0(10 *1 + 00) * 0
3. ϵ + 0(10 *1 + 10) *1
4. ϵ + 0(10 *1 + 10) *10 *
Discuss
Answer: (c).P - 1, Q - 2, R - 3, S - 4
Q72.
Which of the following are regular sets?
Discuss
Answer: (a).I and IV only
Q73.
Which of the following languages is regular?

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (c).C
Q74.
Consider the following Finite State Automaton. The language accepted by this automaton is given by the regular expression

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (c).C
Q75.
Which one of the following is TRUE?

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (c).C
Q76.
Consider the following statement:
Discuss
Answer: (a).{q0, q1, q2}
Q77.
Which of the regular expressions given below represent the following DFA?
I) 0*1(1+00*1)*
II) 0*1*1+11*0*1
III) (0+1)*1
Discuss
Answer: (b).I and III only
Q78.
Which one of the following is CORRECT?
Discuss
Answer: (a).Only (I)
Q79.
If s is a string over (0 + 1)* then let n0(s) denote the number of 0’s in s and n1(s) the number of 1’s in s. Which one of the following languages is not regular?

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (d).D
Discuss
Answer: (b).{w ∈ {a, b}* every a in w is followed by at least two b’}

Suggested Topics

Are you eager to expand your knowledge beyond Theory of Computation(TOC)? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!