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 13 of 16

Explore more Topics under UGC CBSE NET Exam

Q121.
Which of the following is not true?

a.

Power of deterministic automata is equivalent to power of non-deterministic automata.

b.

Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata.

c.

Power of deterministic Turing machine is equivalent to power of non-deterministic Turing machine.

d.

All the above

Discuss
Answer: (b).Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata.
Q122.
Identify the language which is not context - free.

a.

L = {ωωR|ωϵ{0,1}*}

b.

L = {a^nb^n|n≥0}

c.

L = {ωω|ωϵ{0,1}*}

d.

L = {a^nb^mc^md^n | n, m≥0 }

Discuss
Answer: (b).L = {a^nb^n|n≥0}
Q123.
The context-free languages are closed for:

(i) Intersection                          (ii) Union
(iii) Complementation             (iv) Kleene Star

a.

(i) and (iv)

b.

(i) and (iii)

c.

(ii) and (iv)

d.

(ii) and (iii)

Discuss
Answer: (c).(ii) and (iv)
Q124.
Grammars that can be translated to DFAs:

a.

Left linear grammar

b.

Right linear grammar

c.

Generic grammar

d.

All of these

Discuss
Answer: (b).Right linear grammar
Q125.
The language accepted by a Push down Automata:

a.

Type0

b.

Type1

c.

Type2

d.

Type3

Discuss
Answer: (c).Type2
Q126.
In parallel algorithm design, the process of grouping tasks into larger tasks in order to improve performance:

a.

Agglomeration

b.

Domain Decomposition

c.

Mapping

d.

None of these

Discuss
Answer: (a).Agglomeration
Q127.
Recursive Descent Parsers are a type of:

a.

LL parsers

b.

LR parsers

c.

LALR parsers

d.

SLR parsers

Discuss
Answer: (a).LL parsers
Q128.
If language L={0,1}*, then the reversed language L^R =

a.

{0,1}*

b.

{}

c.

{0}*

d.

{1}*

Discuss
Answer: (a).{0,1}*
Q129.
Let r = a(a + b)*, s = aa*b and t = a*b be three regular expressions.
Consider the following:

(i) L(s) ⊆ L(r) and L(s) ⊆ L(t)
(ii) L(r) ⊆ L(s) and L(s) ⊆ L(t)

Choose the correct answer from given below:

a.

Only (i) is correct

b.

Only (ii) is correct

c.

Both (i) and (ii) are correct

d.

Neither (i) nor (ii) is correct

Discuss
Answer: (a).Only (i) is correct
Q130.
Consider the language L given by

L = {2^(nk) ∣ k>0, and n is non-negative integer number}

The minimum number of states of finite automaton which accepts the language L is

a.

n

b.

n+1

c.

n(n+1)/2

d.

2^n

Discuss
Answer: (b).n+1
Page 13 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!

Web Technologies

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

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Neural Networks

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

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Compiler Design

Unravel the process of translating source code into executable programs with our...

Artificial Intelligence

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

Software Architecture and Design

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

Data Structures and Algorithms

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

CompTIA PenTest+ Certification Exam PT0 002

Prepare for the CompTIA PenTest+ PT0-002 exam with our targeted MCQs. Covering...