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

Explore more Topics under GATE CSE Exam

Q81.
The following diagram represents a finite state machine which takes as input a binary number from the least significant bit. Which one of the following is TRUE?

a.

It computes 1's complement of the input number

b.

It computes 2's complement of the input number

c.

It increments the input number

d.

It decrements the input number

Discuss
Answer: (b).It computes 2's complement of the input number
Q82.
The following finite state machine accepts all those binary strings in which the number of 1's and 0's are respectively

a.

divisible by 3 and 2

b.

odd and even

c.

even and odd

d.

divisible by 2 and 3

Discuss
Answer: (a).divisible by 3 and 2
Q83.
Consider the following Deterministic Finite Automata. Which of the following is true?

a.

It only accepts strings with prefix as "aababb"

b.

It only accepts strings with substring as "aababb"

c.

It only accepts strings with suffix as "aababb"

d.

None of the above

Discuss
Answer: (b).It only accepts strings with substring as "aababb"
Q84.
Consider the DFAs M and N given below. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is __________.

a.

0

b.

1

c.

2

d.

3

Discuss
Answer: (b).1
Q85.
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?

a.

Set of all strings that do not end with ab

b.

Set of all strings that begin with either an a or a b

c.

Set of all strings that do not contain the substring ab

d.

The set described by the regular expression b*aa*(ba)*b*

Discuss
Answer: (a).Set of all strings that do not end with ab
Q86.
Consider the following two finite automata. M1 accepts L1 and M2 accepts L2. Which one of the following is TRUE?

a.

L1 = L2

b.

L1 ⊂ L2

c.

L1 ∩ L2' = ∅

d.

L1 ∪ L2 ≠ L1

Discuss
Answer: (a).L1 = L2
Q87.
Consider the following languages. Which one of the following statements is FALSE?

a.

L2 is context-free

b.

L1 intersection L2 is context-free

c.

Complement of L2 is recursive

d.

Complement of L1 is context-free but not regular

Discuss
Answer: (d).Complement of L1 is context-free but not regular
Q88.
Consider the below problem:

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (c).C
Q89.
Consider the following question

a.

Push Down Automata (PDA) can be used to recognize L1 and L2

b.

L1 is a regular language

c.

All the three languages are context free

d.

Turing machine can be used to recognize all the three languages

Discuss
Answer: (c).All the three languages are context free
Q90.
Consider the languages L1 = {0^i1^j | i != j}. L2 = {0^i1^j | i = j}. L3 = {0^i1^j | i = 2j+1}. L4 = {0^i1^j | i != 2j}.

a.

Only L2 is context free

b.

Only L2 and L3 are context free

c.

Only L1 and L2 are context free

d.

All are context free

Discuss
Answer: (d).All are context free
Page 9 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!

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

Java Programming

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

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....