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 1 of 14

Explore more Topics under GATE CSE Exam

Q1.
Given the language L = {ab, aa, baa}, which of the following strings are in L*?

1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa

a.

1, 2 and 3

b.

2, 3 and 4

c.

1, 2 and 4

d.

1, 3 and 4

Discuss
Answer: (c).1, 2 and 4
Q2.
Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?

a.

n-1

b.

n

c.

n+1

d.

2n-1

Discuss
Answer: (c).n+1
Q3.
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.

The set of all strings containing the substring 00

b.

The set of all strings containing at most two 0’s

c.

The set of all strings containing at least two 0’s

d.

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

Discuss
Answer: (c).The set of all strings containing at least two 0’s
Q4.
Which one of the following is FALSE?

a.

There is unique minimal DFA for every regular language

b.

Every NFA can be converted to an equivalent PDA

c.

Complement of every context-free language is recursive

d.

Every nondeterministic PDA can be converted to an equivalent deterministic PDA

Discuss
Answer: (d).Every nondeterministic PDA can be converted to an equivalent deterministic PDA
Q5.
Which of the following statements is false?

a.

Every NFA can be converted to an equivalent DFA

b.

Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine

c.

Every regular language is also a context-free language

d.

Every subset of a recursively enumerable set is recursive

Discuss
Answer: (d).Every subset of a recursively enumerable set is recursive
Q6.
Which of the following is TRUE?

a.

Every subset of a regular set is regular

b.

Every finite subset of a non-regular set is regular

c.

The union of two non-regular sets is not regular

d.

Infinite union of finite sets is regular

Discuss
Answer: (b).Every finite subset of a non-regular set is regular
Q7.
A minimum state deterministic finite automaton accepting the language L={w | w ε {0,1} *, number of 0s and 1s in w are divisible by 3 and 5, respectively} has

a.

15 states

b.

11 states

c.

10 states

d.

9 states

Discuss
Answer: (a).15 states
Q8.
Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences
of (110)’s as (011)’s}.

Let L2 = { ∈ {0,1}∗ | w has at least as many occurrences
of (000)’s as (111)’s}.

Which one of the following is TRUE?

a.

L1 is regular but not L2

b.

L2 is regular but not L!

c.

Both L2 and L1 are regular

d.

Neither L1 nor L2 are regular

Discuss
Answer: (a).L1 is regular but not L2
Q9.
The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is ______________.

a*b*(ba)*a*

a.

2

b.

3

c.

4

d.

5

Discuss
Answer: (b).3
Q10.
Consider the regular language L = (111 + 11111)*. The minimum number of states in any DFA accepting this languages is:

a.

3

b.

5

c.

8

d.

9

Discuss
Answer: (d).9
Page 1 of 14

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!

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...