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

Explore more Topics under UGC CBSE NET Exam

Q41.
Given the following statements :
(A) A class of languages that is closed under union and complementation has to be closed under intersection.
(B) A class of languages that is closed under union and intersection has to be closed under complementation.
Which of the following options is correct?

a.

Both (A) and (B) are false

b.

Both (A) and (B) are true

c.

(A) is true, (B) is false

d.

(A) is false, (B) is true

Discuss
Answer: (c).(A) is true, (B) is false
Q42.
Let G = (V,T,S,P) be a context-free grammar such that every one of its productions is of the form A→v, with |v| = K>1. The derivation tree for any W ϵ L(G) has a height h such that

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (d).4
Q43.
Given the following two languages:

L1 = {a^nb^n|n≥0, n≠100}
L2 = {w ϵ {a,b,c}*| na(w) = nb(w) = nc(w)}

Which of the following options is correct?

a.

Both L1 and L2 are not context free language

b.

Both L1 and L2 are context free language

c.

L1 is context free language, L2 is not context free language

d.

L1 is not context free language, L2 is context free language

Discuss
Answer: (c).L1 is context free language, L2 is not context free language
Q44.
Given the following two statements:

A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear.
B. L = {an bn} U {an b2n} is linear, but not deterministic context free language.

Which of the following options is correct?

a.

Both (A) and (B) are false

b.

Both (A) and (B) are true

c.

(A) is true, (B) is false

d.

(A) is false, (B) is true

Discuss
Answer: (b).Both (A) and (B) are true
Q45.
Which of the following pairs have different expressive power?

a.

Single-tape-turing machine and multi-dimensional turing machine

b.

Multi-tape turing machine and multi-dimensional turing machine

c.

Deterministic push down automata and non-deterministic pushdown automata

d.

Deterministic finite automata and Non-deterministic finite automata

Discuss
Answer: (c).Deterministic push down automata and non-deterministic pushdown automata
Q46.
Which of the following statements is false?

a.

Every context-sensitive language is recursive

b.

The set of all languages that are not recursively enumerable is countable

c.

The family of recursively enumerable languages is closed under union

d.

The families of recursively enumerable and recursive languages are closed under reversal

Discuss
Answer: (b).The set of all languages that are not recursively enumerable is countable
Q47.
Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error.

a.

t + 1

b.

t

c.

t - 2

d.

t/2

Discuss
Answer: (b).t
Q48.
A t-error correcting q-nary linear code must satisfy the following, Where M is the number of code words and X is

a.

q^n

b.

q^t

c.

q^-n

d.

q^-t

Discuss
Answer: (a).q^n
Q49.
From the given data below:

a b b a a b b a a b

which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a, b)?

a.

a b

b.

b b

c.

b a

d.

b a a b

Discuss
Answer: (d).b a a b
Q50.
The number of strings of length 4 that are generated by the regular expression (0+1+|2+3+)*, where | is an alternation character and {+, *} are quantification characters, is:

a.

08

b.

09

c.

10

d.

12

Discuss
Answer: (c).10
Page 5 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!

Microprocessor

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

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

Web Technologies

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

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Wireless and Mobile Communications

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

Visual Basic

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

MongoDB

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

Big Data Computing

Enhance your understanding of Big Data Computing with our comprehensive MCQs. Explore...

Formal Languages and Automata Theory

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