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

Q131.
The number of substrings that can be formed from string given by

a d e f b g h n m p

is
Discuss
Answer: (d).56
Q132.
Consider the following two languages:

L1 = {x ∣ for some y with ∣y∣ = 2^∣x∣,xy ∈ L and L is regular language}
L2 = {x ∣ for some y such that ∣x∣ = ∣y∣, xy ∈ L and L is regular language}

Which one of the following is correct?
Discuss
Answer: (c).Both L1 and L2 are regular languages
Q133.
Consider the following languages:

L1 = {a^(n+m) b^n a^m ∣ n,m ≥ 0}
L2 = {a^(n+m) b^(n+m) a^(n+m) ∣ n,m ≥ 0}

Which of the following is correct?
Discuss
Answer: (a).Only L1 is context-free language
Q134.
Consider R to be any regular language and L1, L2 be any two context-free languages. Which of the following is correct?
Discuss
Answer: (d).L1 – R is context free
Q135.
Consider the following problems:

(i) Whether a finite state automaton halts on all inputs?
(ii) Whether a given context free language is regular?
(iii) Whether a Turing machine computes the product of two numbers?

Which one of the following is correct?
Discuss
Answer: (b).Only (ii) and (iii) are undecidable problems
Q136.
Which of the following problems is decidable for recursive languages (L)?
Discuss
Answer: (b).Is w ∈ L, where w is a string?
Q137.
Consider the following grammar G:

S → A ∣ B
A → a ∣ c
B → b ∣ c
where {S, A, B} is the set of non-terminals, {a, b, c,} is the set of terminals.

Which of the following statement(s) is/are correct?
S1: LR(1) can parse all strings that are generated using grammar G.
S2: LL(1) can parse all strings that are generated using grammar G.
Discuss
Answer: (d).Neither S1 nor S2
Q138.
The grammar S → (S) ∣ SS ∣ ϵ is not suitable for predictive parsing because the grammar is
Discuss
Answer: (c).Ambiguous
Discuss
Answer: (c).Recognize the same set of tokens
Discuss
Answer: (d). any string of odd number of a’s and odd number of b’s

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!