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

Explore more Topics under UGC CBSE NET Exam

Q31.
Given the following two statements :

S1: If L1 and L2 are recursively enumerable languages over Σ, then L1 ⋃ L2 and L1 ⌒ L2 are also recursively enumerable.

S2: The set of recursively enumerable languages is countable.

Which of the following is correct?

a.

S1 is correct and S2 is not correct

b.

S1 is not correct and S2 is correct

c.

Both S1 and S2 are not correct

d.

Both S1 and S2 are correct

Discuss
Answer: (d).Both S1 and S2 are correct
Q32.
Given the following grammars :

G1: S → AB|aaB

A → aA | ∈

B → bB | ∈

G2: S → A | B

A → a A b | ab

B → a b B | ∈

Which of the following is correct?

a.

G1 is ambiguous and G2 is unambiguous grammars

b.

G1 is unambiguous and G2 is ambiguous grammars

c.

both G1 and G2 are ambiguous grammars

d.

both G1 and G2 are unambiguous grammars

Discuss
Answer: (c).both G1 and G2 are ambiguous grammars
Q33.
Let L be any language. Define even (W)  as the  strings  obtained by extracting from W the letters in the even-numbered positions and even (L) = {even (W) | W ԑ L}. We define another language Chop (L) by removing the two leftmost symbols of every string in L given by Chop(L) = {W | v W ԑ L,with | v | = 2}.

If L is regular language then

a.

even (L) is regular and Chop(L) is not regular

b.

Both even(L) and Chop(L) are regular

c.

even(L) is not regular and Chop(L) is regular

d.

Both even (L) and Chop(L) are not regular

Discuss
Answer: (b).Both even(L) and Chop(L) are regular
Q34.
Given the following two grammars :

G1 :     S → AB | aaB

A → a | Aa

B → b

G2: S→ aSbS|bSaS|λ

Which statement is correct ?

a.

G1 is unambiguous, and G2 is unambiguous

b.

G1 is unambiguous and G2 is ambiguous

c.

G1 is ambiguous and G2 is unambiguous

d.

G1 is ambiguous and G2 is ambiguous

Discuss
Answer: (d).G1 is ambiguous and G2 is ambiguous
Q35.
Match the following:

List-I                                                            List-II

a. Chomsky Normal form                       i.  S→ bSS|aS|c

b. Greibach Normal form                        ii.  S→ aSb|ab

c. S-grammar                                           iii. S→ AS|a

                                                                         A→ SA|b

d. |LL grammar                                        iv. S→ aBSB

                                                                         B→ b

Codes:
a       b       c       d

a.

iv      iii       i       ii

b.

iv      iii       ii       i

c.

iii      iv       i       ii

d.

iii      iv       ii       i

Discuss
Answer: (c).iii      iv       i       ii
Q36.
Given the following two languages :

L1 = {anbn |n≥1} ∪ {a}

L2= {w C wR|we {a,b}*}

Which statement is correct ?

a.

Both L1 and L2 are not deterministic

b.

L1 not deterministic and L2 is deterministic

c.

L1 is deterministic and L2 is not deterministic

d.

Both L1 and L2 are deterministic

Discuss
Answer: (d).Both L1 and L2 are deterministic
Q37.
The solution of the recurrence relation of T(n) = 3T ( floor (n/4) ) +  n is

a.

0(n^2)

b.

O(n/gn)

c.

O(n)

d.

O(lgn)

Discuss
Answer: (c).O(n)
Q38.
The number of strings of length 4 that are generated by the regular expression (0|?) 1+2* (3|?), where | is an alternation character, {+, *} are quantification characters, and ? is the null string, is:

a.

8

b.

10

c.

11

d.

12

Discuss
Answer: (d).12
Q39.
Which of the following is FALSE ?

a.

The grammar S ? aSb|bSa|SS|?, where S is the only non-terminal symbol and ? is the null string, is ambiguous

b.

SLR is powerful than LALR

c.

An LL(1) parser is a top-down parser

d.

YACC tool is an LALR(1) parser generator

Discuss
Answer: (b).SLR is powerful than LALR
Q40.
Consider the languages L1 = ϕ, and L2 = {1}. Which one of the following represents
L1* U L2* L1* ?

a.

{ε}

b.

{ε,1}

c.

ϕ

d.

1*

Discuss
Answer: (d).1*
Page 4 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!

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...

Big Data Computing

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

Java Spring Framework

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

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

C Programming

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

Neural Networks

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

Object Oriented Programming Using C++

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

Software Architecture and Design

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

Management Information Systems

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