CS402 QUIZ NO 2 SOLVED 100% VERIFIED BY ADMIN (FINAL TERM SYLLABUS)
    
 
 
   Q1: Which of the following are called as Halt states in PDA?
 
 
  
   A) Start and Accept
  
  
   B) Accept and Reject  (100% Sure)
  
  
   C) Start and Reject
  
  
   D) Read and Reject
  
  
 
 
 
   Q2: Finite Automation (FA) must have __________ number of states while a language has __________ words.
 
 
  
   A) infinite, finite
  
  
   B) finite, finite
  
  
   C) finite, infinite  (100% Sure)
  
  
   D) infinite, infinite
  
  
 
 
 
   Q3: If a language is regular it must generate __________ number of distinct classes.
 
 
  
   A) finite  (100% Sure)
  
  
   B) infinite
  
  
   C) two
  
  
   D) three
  
  
 
 
   Q4: The grammatical rules which involve meaning of words are called __________.
 
 
  
   A) semantics  (100% Sure)
  
  
   B) syntactics
  
  
   C) alphabets
  
  
   D) strings
  
  
 
 
   Q5: There is at least production in CFG that has one __________ on its left side.
 
 
  
   A) Terminal  
  
  
   B) Null production
  
  
   C) Unit production
  
  
   D) Non terminal  (100% Sure)
  
  
 
 
 
   Q6: Identify the correct statement from the following:
 
 
  
   A) There always exists a corresponding PDA for every CFG  (100% Sure)
  
  
   B) There does not exists a corresponding PDA for every CFG
  
  
   C) For a CFG to convert to PDA, the CFG should have at least 3 Nonterminals
  
  
   D) For a CFG to convert to PDA, the CFG should have at least 5 Nonterminals  
  
  
 
 
 
   Q7: A PDA is called nondeterministic PDA if __________
 
 
  
   A)  there are more than one outgoing edges at READ or POP states with one label  (100% Sure)
  
  
   B) there are more than one PUSH states
  
  
   C) there are more than one POP states
  
  
   D) every READ state is followed by a HERE state 
  
  
 
 
 
   Q8: The basic approach of Myhill Nerode theorem is similar to the concept of:
 
 
  
   A)  distinguishable and indistinguishable strings  (100% Sure)
  
  
   B) union of FAs
  
  
   C) concatenation of FAs
  
  
   D) closure of FAs
  
  
 
 
   Q9: Like TG, the __________ can be considered as a PDA in conversion form.
 
 
  
   A)  set of joints  (100% Sure)
  
  
   B) set of Forks
  
  
   C) set of Plugs
  
  
   D) set of blocks
  
  
 
 
   Q10: In large FA with thousand of states and millions of directed edges, without an effective procedure it is __________ to find a path from initial to final state.
 
 
  
   A)  Always easy
  
  
   B) Impossible  (100% Sure)
  
  
   C) may be good
  
  
   D) always impossible