CS402 Final Term Solved MCQs Set 4 by Junaid

1. If Σ = {aa, bb} , then Σ* will not contain

aaabbb

1. aabbbb
2. aabbaa
3. bbaabbbb

Q2. “One language can have _________ TG‟s”.

1. Only one
2. Only two
3. More than one
4. Only three

Correct answer: More than one

Q3. According to 1st part of the Kleene‟s theorem, If a language can be accepted by an FA then it can be accepted by a ________ as well.

1. FA
2. CFG
3. GTG
4. TG

Correct answer: TG

Q4. Even-palindrome is a _______ language.

1. Non-regular
2. Regular
3. Regular but infinite

Correct answer: Non-regular

ALL answers are verified if found any mistake then Correct ACCORDINGLY

1. Regular but finite

Q5. If L is a regular language then, Lc is also a _____ language.

1. Regular (Page 66)
2. Non-regular
3. Regular but finite
4. None of the given

Correct answer: Regular (Page 66)

Q6. Pumping lemma is generally used to prove that:

1. A given language is infinite
2. A given language is not regular
3. Whether two given regular expressions of a regular language are equivalent or not
4. None of these

Correct answer: A given language is not regular

Q7. the FA has N states, then test the words of length less than N. If no word is accepted by this FA, then it will _________ word/words.

1. accept all
2. accept no (Page 85)
3. accept some
4. reject no

Correct answer: accept no (Page 85)

Q8. In CFG, the symbols that can‟t be replaced by anything are called________.

1. Terminal (Page 87)
2. Non-Terminal
3. Production
4. All of given

Correct answer: Terminal (Page 87)

Q9. Which of the following is a regular language?

1. String of odd number of zeroes
2. Set of all palindromes made up of 0‟s and 1‟s
3. String of 0‟s whose length is a prime number
4. All of these

Correct answer: String of odd number of zeroes

Q10. Which of the following pairs of regular expressions are equivalent?

1. 1(001)* and (10)*10
2. x(xx)* and (x)*x
3. X  and X*
4. X  and X* X 

Correct answer: x(xx)* and (x)*x

Q11. An alphabet of Σ is valid if

1. No letter of Σ appears in middle of any other letter
2. No letter of Σ appears at end of any other letter
3. No letter of Σ appears at start of any other letter
4. No letter of Σ appears at end or middle of any other letter

Correct answer: No letter of Σ appears at start of any other letter

Q12. Which of the following statement is true

1. The length of the output string is greater than length of input string in moore machine.
2. The length of the output string is greater than length of input string in mealy machine.
3. The length of the output string is equal to length of input string in moore machine.
4. The length of the output string is less than length of input string in mealy machine.

Correct answer: The length of the output string is greater than length of input string in moore machine.