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

Explore more Topics under GATE CSE Exam

Q51.
Which of the following is true?

a.

The complement of a recursive language is recursive.

b.

The complement of a recursively enumerable language is recursively enumerable.

c.

The complement of a recursive language is either recursive or recursively enumerable.

d.

The complement of a context-free language is context-free.

Discuss
Answer: (a).The complement of a recursive language is recursive.
Q52.
The C language is:

a.

A context free language

b.

A context sensitive language

c.

A regular language

d.

Parasble fully only by a Turing machine

Discuss
Answer: (a).A context free language
Q53.
Ram and Shyam have been asked to show that a certain problem Π is NP-complete. Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these reductions ?

a.

Π is NP-hard but not NP-complete

b.

Π is in NP, but is not NP-complete

c.

Π is NP-complete

d.

Π is neither NP-hard, nor in NP

Discuss
Answer: (c).Π is NP-complete
Q54.
Nobody knows yet if P = NP. Consider the language L defined as follows. Which of the following statements is true ?

a.

L is recursive

b.

L is recursively enumerable but not recursive

c.

L is not recursively enumerable

d.

Whether L is recursive or not will be known after we find out if P = NP

Discuss
Answer: (a).L is recursive
Q55.
If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true ?

a.

L is necessarily finite

b.

L is regular but not necessarily finite

c.

L is context free but not necessarily regular

d.

L is recursive but not necessarily context free

Discuss
Answer: (d).L is recursive but not necessarily context free
Q56.
Consider the following deterministic finite state automaton M. Let S denote the set of seven bit binary strings in which the first, the fourth, and the last bits are 1. The number of strings in S that are accepted by M is

a.

1

b.

5

c.

7

d.

8

Discuss
Answer: (c).7
Q57.
Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R is S → a S b | SS | ε . Which of the following statements is true?

a.

G is not ambiguous

b.

There exist x, y, ∈ L (G) such that xy ∉ L(G)

c.

There is a deterministic pushdown automaton that accepts L(G)

d.

We can find a deterministic finite state automaton that accepts L(G)

Discuss
Answer: (c).There is a deterministic pushdown automaton that accepts L(G)
Q58.
Define languages L0 and L1 as follows :

L0 = {< M, w, 0 > | M halts on w}
L1 = {< M, w, 1 > | M does not halts on w}

Here < M, w, i > is a triplet, whose first component. M is an encoding of a Turing Machine, second component, w, is a string, and third component, i, is a bit. Let L = L0 ∪ L1. Which of the following is true ?

a.

L is recursively enumerable, but L' is not

b.

L' is recursively enumerable, but L is not

c.

Both L and L' are recursive

d.

Neither L nor L' is recursively enumerable

Discuss
Answer: (a).L is recursively enumerable, but L' is not
Q59.
Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true ?

a.

L1 = {0, 1}* - L

b.

L1 = {0, 1}*

c.

L1 ⊆ L

d.

L1 = L

Discuss
Answer: (b).L1 = {0, 1}*
Q60.
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

Discuss
Answer: (a).divisible by 3 and 2
Page 6 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!

Digital Logic Design

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

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Systems Analysis and Design Methods

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

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

Java Programming

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

Cryptography and Network Security

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

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...