CS402 Quiz 4 January 2026

Quiz 1 - CS402 (Q1/10)

Question:

Mealy machine is equivalent to Moore machine, if we:

A. Ignore the extra input character inserted by the Moore machine

B. Ignore the extra character printed by the Moore machine

C. Ignore the extra input character inserted by the Mealy machine D. Ignore the extra character printed by the Mealy machine Copied: 1/6/2026, 12:04:52 PM

Quiz 2 - CS402 (Q2/10)

Question:

In pumping lemma theorem (x y^n z) the range of n is

A. n=…….-3,-2,-1, 1, 2, 3, 4…… B. n=0, 1, 2, 3, 4………. C. n=…….-3,-2,-1, 0, 1, 2, 3, 4…… D. n=1, 2, 3, 4………. Copied: 1/6/2026, 12:05:37 PM

Quiz 3 - CS402 (Q3/10)

Question:

�T�h�e� �C�F�G� �S� !’� �a�S�b�|�a�b�|›� �i�s� �u�s�e�d� �t�o� �e�x�p�r�e�s�s� �t�h�e� �l�a�n�g�u�a�g�e� �_�_�_�_�_�_�_�_�_�.

A. Even

B. Prime

C. Equal

D. Palindrome

Copied: 1/6/2026, 12:06:08 PM

Quiz 4 - CS402 (Q4/10)

Question:

If a language is regular it must generate ____________ number of distinct classes.

A. two

B. finite

C. three D. infinite Copied: 1/6/2026, 12:06:22 PM

Quiz 5 - CS402 (Q5/10)

Question:

What will be the 9’s complement of the number 872?

1. 271
2. 127
3. 172
4. 721

Correct answer: 127

Copied: 1/6/2026, 12:06:46 PM

Quiz 6 - CS402 (Q6/10)

Question:

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

1. z
2. x
3. n
4. y

Correct answer: y

Copied: 1/6/2026, 12:07:01 PM

Quiz 7 - CS402 (Q7/10)

Question:

If L1 and L2 are two regular languages, then they _______ expressed by FAs.

A. cannot be B. May be C. may or may not be

D. can be

Copied: 1/6/2026, 12:07:15 PM

Quiz 8 - CS402 (Q8/10)

Question:

The CFG is said to be ambiguous if there exist at least one word of its language that can be generated by ______ production tree(s).