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

Explore more Topics under UGC CBSE NET Exam

Q91.
A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ
(s1) δ(q, a, b) contains at most one element
(s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ

a.

only s1

b.

only s2

c.

both s1 and s2

d.

neither s1 nor s2

Discuss
Answer: (c).both s1 and s2
Q92.
For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to

a.

ln|w|

b.

|w|

c.

|w|^2

d.

|w|^3

Discuss
Answer: (d).|w|^3
Q93.
Match the following:

a. Context sensitive language          i. Deterministic finite automation
b. Regular grammar                            ii. Recursive enumerable
c. Context free grammar                     iii. Recursive language
d. Unrestricted grammar                     iv. Pushdown automation

Codes:
      a   b    c   d

a.

ii    i    iv   iii

b.

iii   iv   i    ii

c.

iii   i    iv   ii

d.

ii    iv   i   iii

Discuss
Answer: (c).iii   i    iv   ii
Q94.
The statements s1 and s2 are given as:

s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism.
s2: Context free languages are closed under complementation, substitution and homomorphism.

Which of the following is correct statement?

a.

Both s1 and s2 are correct

b.

s1 is correct and s2 is not correct

c.

s1 is not correct and s2 is correct

d.

Both s1 and s2 are not correct

Discuss
Answer: (b).s1 is correct and s2 is not correct
Q95.
Consider the following statements :

I. Recursive languages are closed under complementation.
II. Recursively enumerable languages are closed under union.
III. Recursively enumerable languages are closed under complementation.

Which of the above statements are true ?

a.

I only

b.

I and II

c.

I and III

d.

II and III

Discuss
Answer: (b).I and II
Q96.
Given the following statements :

(i) The power of deterministic finite state machine and nondeterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.

Which of the above is the correct statement(s) ?

a.

Both (i) and (ii)

b.

Only (i)

c.

Only (ii)

d.

Neither (i) nor (ii)

Discuss
Answer: (b).Only (i)
Q97.
Let Q(x, y) denote “x + y = 0” and let there be two quantifications given as follows, where x & y are real numbers. Then which of the following is valid ?

a.

(i) is true & (ii) is false

b.

(i) is false & (ii) is true

c.

(i) is false & (ii) is also false

d.

both (i) & (ii) are true

Discuss
Answer: (b).(i) is false & (ii) is true
Q98.
Which is not the correct statement(s) ?

(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.

a.

(i) is true, (ii) is false

b.

(i) is true and (ii) is true

c.

(i) is false, (ii) is false

d.

(i) is false and (ii) is true

Discuss
Answer: (b).(i) is true and (ii) is true
Q99.
Which one of the following is not a Greibach Normal form grammar?

(i)            S ->a|bA|aA|bB
A->a
B->b
(ii)           S->a|aA|AB
A->a
B->b
(iii)          S->a|A|aA
A->a

a.

(i) and (ii)

b.

(i) and (iii)

c.

(ii) and (iii)

d.

(i), (ii) and (iii)

Discuss
Answer: (c).(ii) and (iii)
Q100.
The equivalent grammar corresponding to the grammar G:S→aA,A→BB,B→aBb∣εG:S→aA,A→BB,B→aBb∣ε is

a.

S→aA,A→BB,B→aBb

b.

S→a∣aA,A→BB,B→aBb∣ab

c.

S→a∣aA,A→BB∣B,B→aBb

d.

S→a∣aA,A→BB∣B,B→aBb∣ab

Discuss
Answer: (d).S→a∣aA,A→BB∣B,B→aBb∣ab
Page 10 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!

Data Structures and Algorithms

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

Wireless and Mobile Communications

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

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

Artificial Intelligence

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

MS Office

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

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....