# CS402 Quiz No 2 Solution 2024

Students if you are looking for a CS402 Quiz No 2 Solution if yes? then you reach the right place where you can easily find Quiz 2 for the midterm exams where students can easily complete their CS402 Quiz preparation.

Students you know these are Theory of Automata Midterm Quiz for the virtual university students who have this book CS402 and their students looking for the Midterm MCQs.

## CS402 Quiz No 2 Answers

1: In the case of Myhill Nerode theorem, if a language L partitions sigma star into distinct classes and L is also regular then L generates a number of classes.

odd
specified
finite
infinite

2: In a CFG the non-terminal that occurs first from the left in the working string, is said to be,

Least Significant nonterminal
Left most derivate
Left most nonterminal
Most Significant nonterminal

3: The language of all strings partition * into. class(es).

four
two
three
one

4: In the null production N–> ^, N is a

Word
Nonterminal
Terminal
Semi word

5: A is the one for which every input string has a unique path through the machine.

nondeterministic PDA
PUSHDOWN store
deterministic PDA
Input Tape

6: Which of the following is pumped to generate further strings in the definition of Pumping Lemma?

N
n
X
y

7: A nonregular language can be represented by

None of the given options
TG
FA
RE

8: If a language generates a finite number of distinct classes then it must be

regular
non-regular
context-free
both regular and context-free

9: Consider the Following CFG: (NOTE: ^ means NULL) S->Xa
X->aX|bx|^
The above given CFG can be represented by RE…………….

aba
(a+b)an ab*
(a+b)*a

10: The language “PRIME” is an example of………………..language.

nonregular but finite
nonregular
regular but finite
regular

11: The strings or words which do not belong to a language are called of that language.

Intersection
Quotient
Complement
Union

12: states are called the halt states.

ACCEPT and REJECT
ACCEPT AND START
ACCEPT AND WRITE

13: In the new format of an FA (discussed in lecture 37),…………..state is like a dead-end nonfinal state.

ACCEPT
REJECT
START

14: To write the expression from the tree, it is required to traverse from

The left side of the tree
Bottom to top of the tree
Top to bottom of the tree
The right side of the free

15: We have FA accepting the language L, if we are going to find the complement of L, then we should:

Only change FA’s old final states into nonfinal states
Change FA final states into nonfinal states
Change FA nonfinal states into final and final states into nonfinal states
Change FA nonfinal states into final states

16: “CFG” stands for.

Context Free Grammar
Context Free Graph
Context Finite Grammar
Context Finite Graph