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

Explore more Topics under UGC CBSE NET Exam

Q101.
Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

a.

n states

b.

n + 1 states

c.

n + 2 states

d.

2^n states

Discuss
Answer: (b).n + 1 states
Q102.
The following CFG

S->aB|bA, A->a|as|bAA, B->b|bs|aBB

generates strings of terminals that have

a.

odd number of a’s and odd number of b’s

b.

even number of a’s and even number of b’s

c.

equal number of a’s and b’s

d.

not equal number of a’s and b’s

Discuss
Answer: (c).equal number of a’s and b’s
Q103.
The regular expression for the following DFA is

a.

ab*(b + aa*b)*

b.

a*b(b + aa*b)*

c.

a*b(b* + aa*b)

d.

a*b(b * + aa*b)*

Discuss
Answer: (d).a*b(b * + aa*b)*
Q104.
Match the following :

(i) Regular Grammar                           (a) Pushdown automaton
(ii) Context free Grammar                   (b) Linear bounded automaton
(iii) Unrestricted Grammar                  (c) Deterministic finite automaton
(iv) Context Sensitive Grammar        (d) Turing machine
     
(i)   (ii)   (iii)  (iv)

a.

(c)  (a)   (b)  (d)

b.

(c)  (a)   (d)  (b)

c.

(c)  (b)   (a)  (d)

d.

(c)  (b)   (d)  (a)

Discuss
Answer: (b).(c)  (a)   (d)  (b)
Q105.
Which one of the following statement is false?

a.

Context-free languages are closed under union.

b.

Context-free languages are closed under concatenation.

c.

Context-free languages are closed under intersection.

d.

Context-free languages are closed under Kleene closure.

Discuss
Answer: (d).Context-free languages are closed under Kleene closure.
Q106.
Which of the following grammar is LR (1)?

a.

A->aAb, A->bAb, A->a , A->b

b.

A->aAa, A->aAb, A->c

c.

A->A+A, A->a

d.

Both a and b

Discuss
Answer: (d).Both a and b
Q107.
Context-free Grammar (CFG) can be recognized by

a.

Finite state automata

b.

2-way linear bounded automata

c.

push down automata

d.

both b and c

Discuss
Answer: (d).both b and c
Q108.
A context free grammar is:

a.

type 0

b.

type 1

c.

type 2

d.

type 3

Discuss
Answer: (c).type 2
Q109.
Let e: B˄m→B˄n is a group code. The minimum distance of ‘e’ is equal to:

a.

the maximum weight of a non zero code word

b.

the minimum weight of a non zero code word

c.

m

d.

n

Discuss
Answer: (b).the minimum weight of a non zero code word
Q110.
Consider a Moore Machine M whose digraph is given below. Then L(M), the language accepted by the machine M, is the set of all strings having:

a.

two or more b’s

b.

three or more b’s

c.

two or more a’s

d.

three or more a’s

Discuss
Answer: (a).two or more b’s
Page 11 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!

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

Microprocessor

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

Management Information Systems

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

Software Engineering

Learn about the systematic approach to developing software with our Software...

CSS

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

Data Structures and Algorithms

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

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

C# programming

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

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...