CS402 Solved Quiz 3 by Iqra Azhar

1. Let FA1 accepts many strings and FA2 accepts no string, then FA1 + FA2 will be equal to: o (A) (FA2)* o (B) FA2 o (C) FA2 − FA1 o (D) FA1 Correct
2. Every NFA can be considered to be a -------- as well, but the converse may not be true: o (A) TG o (B) FA Correct o (C) PDA o (D) GTG

Q3. Which of the following is used to delay the transmission of signal along the wire by one step (clock pulse)?

o (A) Holdup box o (B) Slow box o (C) Reduce box o (D) Delay box Correct

4. Strings x, y, z belong to Σ such that xz ∈ L but yz ∉ L where L ⊆ Σ are:** o (A) Indistinguishable o (B) Distinguishable Correct o (C) Undetermined o (D) Both distinguishable and indistinguishable

Q5. How many new states are introduced while developing NFA for the closure of an FA?

o (A) Four o (B) One o (C) Three o (D) Two Correct

6. Let FA3 be an FA corresponding to FA1FA2, then the final state of FA3 must correspond to the final state of: o (A) FA1 or FA2 o (B) FA1 and FA2 o (C) FA1 only o (D) FA2 only Correct

Q7. If new A = 1 NAND (1 AND 1), then what will be the value of new A?

o (A) 0 Correct o (B) 1 o (C) 10 o (D) 01

8. In Moore machine the output depends on: