CS402 Quiz 2 Lectures 29-40 by Junaid

1. To write the expression from the tree,it is required to travel from____

•  Top to bottom of the tree
•  Left side of the tree
•  Bottom to top of the tree
•  Right side of the tree

2. In conversion from of PDA, no two___states exit in a row without___state.

•  PUSH, READ
•  POP, READ
•  PUSH, START
•  POP, REJECT

3. The CFG-SaSa|a|b|^represents____language.

•  EVEN-EVEN
•  PALINDROME
•  EQUAL
•  ODD-ODD

4. The CFG that generates the regular language is called____

•  Regular expression
•  Finite automata
•  Regular grammar
•  Non-regular grammar

5. Null production is a____

•  Word
•  String
•  Terminal

6. The CFG is said to be ambiguous if there exist at least one word of its language that can be generated by___ production trees

•  One
•  Two

ALL answers are verified if found any

mistake then Correct ACCORDINGLY

•  At most one

7. The structure given below is called S->aA|bB A->aS|a B->bS|b

•  RE
•  TG
•  CFG
•  PDA

8. Identify the TRUE statement.

•  A PDA is Non-deterministic, if there are more than one READ state in PDA
•  A PDA is never non-deterministic
•  Like TG,A PDA can also be non- deterministic
•  A PDA is Non-deterministic, if there are more than one REJECT state in PDA

9. In new format of an FA (discussed in Leacture 37)._____state is like a final state of an FA

•  ACCEPT
•  REJECT
•  START
•  READ

10. In new format of an FA (discussed in Leacture 37)._____state is like a Initial state of an FA

•  ACCEPT
•  REJECT
•  START
•  READ

11. Consider the Following CFG (NOTE:^means NULL) S-> Xa X->aX|bx|^ Above given CFG can be represented by RE___

•  A*b*
•  A*b*a
•  (a+b)*a
•  a(a+b)*a

12. The major problem in the earliest computers was____

•  TO state the contents in the registers
•  To display mathematically formula
•  To Load contents from the register
•  To calculate the mathematically formula

13. Identify the correct statement from the following:

•  There always exists a corresponding PDA for every CFG
•  There does not exist a corresponding PDA for every CFG
•  For a CFG to convert to PDA the CFG should have at least 3 Nonterminal
•  For a CFG to convert to PDA the CFG should have at least 5 Nonterminal

14. The PDA is called non-deterministic PDA when there are more than one out going edges from___state.

•  START or READ
•  POP or REJECT
•  READ or POP
•  PUSH or POP

15. Identifying the FALSE statement about following CFG. S->SB|AB A->CC B->b C->a

•  CFG generated NULL string
•  CFG is not in CNF
•  CFG has 8 Nonterminal

16. In nondeterministic PDA, a string is supposed to be accepted if there exists at least one path traced by the string, leading to____state.

•  ACCEPT