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

Explore more Topics under UGC CBSE NET Exam

Q71.
A shift reduce parser suffers from

a.

shift reduce conflict only

b.

reduce reduce conflict only

c.

both shift reduce conflict and reduce reduce conflict

d.

shift handle and reduce handle conflicts

Discuss
Answer: (c).both shift reduce conflict and reduce reduce conflict
Q72.
The context free grammar for language L = {a^nb^mc^k | k = |n - m|, n≥0,m≥0,k≥0} is

a.

S→S1S3, S1→aS1c |S2|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ

b.

S→S1S3, S1→aS1S2c |λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ

c.

S→S1|S2, S1→aS1S2c|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ

d.

S→S1|S3, S1→aS1c |S2|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ

Discuss
Answer: (d).S→S1|S3, S1→aS1c |S2|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ
Q73.
The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n≥4 } is

a.

3

b.

4

c.

5

d.

6

Discuss
Answer: (c).5
Q74.
Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is

a.

(1 + 010)*

b.

(01 + 10)*

c.

(1 + 010)* (0 + λ)

d.

(1 + 01)* (0 + λ)

Discuss
Answer: (d).(1 + 01)* (0 + λ)
Q75.
Consider the following two languages:

L1 = {a^n b^l a^k | n + l +k>5 }
L2 = {a^n b^l a^k |n>5, l >3, k≤ l }

Which of the following is true?

a.

L1 is regular language and L2 is not regular language

b.

Both L1 and L2 are regular languages

c.

Both L1 and L2 are not regular languages

d.

L1 is not regular language and L2 is regular language

Discuss
Answer: (a).L1 is regular language and L2 is not regular language
Q76.
LL grammar for the language L = {a^n b^m c^n+m | m≥0, n≥0} is

a.

S → aSc | S1 ; S1 → bS1c | λ

b.

S → aSc | S1| λ ; S1 → bS1c

c.

S → aSc | S1| λ ; S1 → bS1c| λ

d.

S → aSc | λ ; S1 → bS1c| λ

Discuss
Answer: (c).S → aSc | S1| λ ; S1 → bS1c| λ
Q77.
Assume the statements S1 and S2 given as:

S1: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same language.

Which of the following is true?

a.

S1 is correct and S2 is not correct

b.

Both S1 and S2 are correct

c.

Both S1 and S2 are not correct

d.

S1 is not correct and S2 is correct

Discuss
Answer: (a).S1 is correct and S2 is not correct
Q78.
Assume, L is regular language. Let statements S1 and S2 be defined as :

S1 : SQRT(L) = { x| for some y with |y| = |x|^2, xy ∈L}
S2 : LOG(L) = { x| for some y with |y| = 2^|x|, xy ∈ L}

Which of the following is true ?

a.

S1 is correct and S2 is not correct

b.

Both S1 and S2 are correct

c.

Both S1 and S2 are not correct

d.

S1 is not correct and S2 is correct

Discuss
Answer: (b).Both S1 and S2 are correct
Q79.
A regular grammar for the language L = {a^nb^m | n is even and m is even}is given by

a.

S→aSb | S1; S1 → bS1a | λ

b.

S→aaS | S1; S1 → bSb | λ

c.

S→aSb | S1; S1 → S1ab | λ

d.

S→aaS | S1; S1 → bbS1 | λ

Discuss
Answer: (d).S→aaS | S1; S1 → bbS1 | λ
Q80.
Given the following productions of a grammar :

S→ aA| aBB;
A→aaA |λ ;
B→ bB| bbC;
C→ B

Which of the following is true ?

a.

The language corresponding to the given grammar is a set of even number of a’s.

b.

The language corresponding to the given grammar is a set of odd number of a’s.

c.

The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s.

d.

The language corresponding to the given grammar is a set of odd number of a’s followed by even number of b’s.

Discuss
Answer: (b).The language corresponding to the given grammar is a set of odd number of a’s.
Page 8 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!

HTML

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

Hadoop

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

Operating System

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

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

C Programming

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

MySQL Database

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

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...