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

Explore more Topics under GATE CSE Exam

Q41.
Consider the grammar G.

E -> TE’
E’ -> +TE’ | ԑ
T’ -> FT’
T’ -> *FT’ | ԑ
F -> (E) | id

If LL(1) parsing table is constructed using the grammar G, then how many entries are present in the row that represents E’ nonterminal ? (consider the entries which are not error/not blank entries)

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (c).3
Q42.
Let, init (L) = {set of all prefixes of L},
Let L = {w | w has equal number of 0’s and 1’s}
init (L) will contain:

a.

all binary strings with unequal number of 0’s and 1’s

b.

all binary strings with ԑ-string

c.

all binary strings with exactly one more 0's than number of 1's

d.

None of above

Discuss
Answer: (b).all binary strings with ԑ-string
Q43.
Suppose M1 and M2 are two TM’s such that L(M1) = L(M2). Then

a.

On every input on which M1 doesn’t halt, M2 doesn’t halt too

b.

On every i/p on which M1 halts, M2 halts too

c.

On every i/p which M1 accepts, M2 halts

d.

None of above

Discuss
Answer: (c).On every i/p which M1 accepts, M2 halts
Q44.
Consider the following decision problems:

(P1) Does a given finite state machine accept a given string
(P2) Does a given context free grammar generate an infinite
number of stings

Which of the following statements is true?

a.

Both (P1) and (P2) are decidable

b.

Neither (P1) nor (P2) are decidable

c.

Only (P1) is decidable

d.

Only (P2) is decidable

Discuss
Answer: (a).Both (P1) and (P2) are decidable
Q45.
Consider the following two statements:

a.

Only S1 is correct

b.

Only S2 is correct

c.

Both S1 and S2 are correct

d.

None of S1 and S2 is correct

Discuss
Answer: (a).Only S1 is correct
Q46.
Which of the following statements is true ?

a.

If a language is context free it can always be accepted by a deterministic push-down automaton

b.

The union of two context free languages is context free

c.

The intersection of two context free languages is context free

d.

The complement of a context free language is context free

Discuss
Answer: (b).The union of two context free languages is context free
Q47.
Consider the following languages. Which of the languages are regular?

a.

Only L1 and L2

b.

Only L2, L3 and L4

c.

Only L3 and L4

d.

Only L3

Discuss
Answer: (d).Only L3
Q48.
Consider the following problem X.

Given a Turing machine M over the input alphabet Σ, any
state q of M And a word w∈Σ*, does the computation of M
on w visit the state q?

Which of the following statements about X is correct?

a.

X is decidable

b.

X is undecidable but partially decidable

c.

X is undecidable and not even partially decidable

d.

X is not a decision problem

Discuss
Answer: (b).X is undecidable but partially decidable
Q49.
The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as

a.

Context Free

b.

Regular

c.

Deterministic Context Free

d.

Recursive

Discuss
Answer: (b).Regular
Q50.
The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit output

a.

Outputs the sum of the present and the previous bits of the input.

b.

Outputs 01 whenever the input sequence contains 11.

c.

Outputs 00 whenever the input sequence contains 10.

d.

None of these

Discuss
Answer: (a).Outputs the sum of the present and the previous bits of the input.
Page 5 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!

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

Data Science

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

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

C# programming

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

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...