CS402 Grand Quiz Mega File by Ans Mughal

CS402 Grand Quiz (Screenshots) Mega File

1. The minimum length of the strings(except null string) of a language that starts and ends in the same letter will be:

•  1
•  2
•  3
•  4

2. If S = {ab,bb} then S* will not contain ________.

•  abbbab
•  bbba
•  bbbbab
•  ababbb

Q3. Which of the following machine has only one initial state and no final state?

 Moore machine

•  Finite state machine
•  Deterministic finite state machine
•  Non deterministic finite state machine

Q4. Which of the following diagram is very rigid in order to express any language?

•  TG
•  NFA^
•  GTG
•  FA

5. If S = {a}, then S+ will be _____

•  {a, aaa, aaaa, aaaaa,…}

 {a, aa, aaa, aaaa,…}

•  {a, aaa, aaaaa, aaaaaaa,…}
•  {aa, aaaa, aaaaaa, aaaaaaaa,…}

Q6. Let L be the language of all strings. defined over ∑ = {0,1}. ending in 111. Which of the following strings are indistinguishable with respect to L with z being 11?

 111, 101

•  100, 101
•  110, 101
•  010, 101

7. Melay machine can have ------- final states.

•  Zero
•  One
•  More than one but finite
•  More than one but infinite

8. In Moore machine, output is produced over the change of:

•  Transitions

 States

•  Transitions and states
•  None of the mentioned

Q9. Given the language L = {ab, aa, baa}, which of the following strings are in L*?

1. abaabaaabaa
2. aaaaaaaaa
3. baaaaabaaaab
4. baaaaabaa

•  1, 2 and 3
•  2, 3 and 4