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 UGC CBSE NET 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 UGC CBSE NET 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 UGC CBSE NET 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 15 of 16

Explore more Topics under UGC CBSE NET Exam

Q141.
A pushdown automata behaves like a Turing machine when the number of auxiliary memory is:

a.

0

b.

1

c.

1 or more

d.

2 or more

Discuss
Answer: (d).2 or more
Q142.
Pushdown automata can recognize language generated by ................

a.

Only context free grammar

b.

Only regular grammar

c.

Context free grammar or regular grammar

d.

Only context sensitive grammar

Discuss
Answer: (c).Context free grammar or regular grammar
Q143.
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:

a.

2n−1

b.

2n

c.

n+1

d.

n^2

Discuss
Answer: (a).2n−1
Q144.
Consider the following two Grammars:

G1 : S → SbS | a
G2 : S → aB | ab, A→GAB | a, B→ABb | b

Which of the following option is correct?

a.

Only G1 is ambiguous

b.

Only G2 is ambiguous

c.

Both G1 and G2 are ambiguous

d.

Both G1 and G2 are not ambiguous

Discuss
Answer: (c).Both G1 and G2 are ambiguous
Q145.
Context sensitive language can be recognized by a:

a.

Finite state machine

b.

Deterministic finite automata

c.

Non-deterministic finite automata

d.

Linear bounded automata

Discuss
Answer: (d).Linear bounded automata
Q146.
The set A={ 0^n 1^n 2^n | n=1, 2, 3, ......... } is an example of a grammar that is:

a.

Context sensitive

b.

Context free

c.

Regular

d.

None of the above

Discuss
Answer: (a).Context sensitive
Q147.
A bottom-up parser generates:

a.

Left-most derivation in reverse

b.

Right-most derivation in reverse

c.

Left-most derivation

d.

Right-most derivation

Discuss
Answer: (b).Right-most derivation in reverse
Q148.
Consider the following statements:

S1 : There exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same language.
S2 : The problem of determining whether a Turing machine halts on any input is undecidable.

Which of the following options is correct?

a.

Both S1 and S2 are correct

b.

Both S1 and S2 are not correct

c.

Only S1 is correct

d.

Only S2 is correct

Discuss
Answer: (a).Both S1 and S2 are correct
Q149.
Which of the following regular expressions, each describing a language of binary numbers (MSB to LSB) that represents non-negative decimal values, does not include even values? (Where {+, *} are quantification characters.)

a.

0*1+0*1*

b.

0*1*0+1*

c.

0*1*0*1+

d.

0+1*0*1*

Discuss
Answer: (c).0*1*0*1+
Q150.
Which of the following statements is/ are TRUE?

(a) The grammar S → SS a is ambiguous. (Where S is the start symbol)
(b) The grammar S → 0S1 | 01S | ϵ is ambiguous. (The special symbol ϵ represents the empty string) (Where S is the start symbol)
(c) The grammar (Where S is the start symbol)
S → T/U
T → x S y | xy | ϵ
U → yT
generates a language consisting of the string yxxyy.

a.

Only (a) and (b) are TRUE.

b.

Only (a) and (c) are TRUE.

c.

Only (b) and (c) are TRUE.

d.

All of (a), (b) and (c) are TRUE.

Discuss
Answer: (d).All of (a), (b) and (c) are TRUE.
Page 15 of 16

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....

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...

Digital Image Processing (DIP)

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

Operating System

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

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

UNIX

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