![]() |
|
#1
|
||||
|
||||
|
cs402 current papr
Multiple choice 20 marks ,,,, Different between word and strings? 2 marks What is Transition? 2 marks Different between Distinguishable strings and indistinguishable strings? 3 marks Explain Mealy machine ? 3 marks NFA corresponding to the Closure of an FA 5 marks TGs: accepting all strings, accepting none, starting with b, not ending in b, containing aa, containing aa or bb…….. 5 marks Some of the questions from today's CS402 mid term exam. I remembered some of them, these may be helpful for your upcoming exam. Write at least one similarity and one difference between DFA & NFA One question was about mealy machine. Following machine was shown with following questions a. What is ∑ and Г for this machine b. What will be output of this machine if 110001101 is input c. Describe the purpose of this machine By looking at transition diagram, how can we identify whether it is FA or TG Differentiate FA,TG & GTG MCQ: What is RE of following diagram MCQ: How many words will be there for language of n characters with m length n+m, n*m, nm, none MCQ: What is RE of EVEN-EVEN machine MCQ: How many minimum nodes are required in NFA of ODD language M.C.Qs True/False on NFA and Dead states (2) FA Doesn't accepts strings in which 3 conditions, Write all (3) Define Mealy Machine(3) marks 5 question, with 3 parts What Mealy Machine will do If Sigma=0011000 What is value Sigma and Gamma? What will be the final result of that given sigma cs402 current papr Multiple choice 20 marks ,,,, Different between word and strings? 2 marks What is Transition? 2 marks Different between Distinguishable strings and indistinguishable strings? 3 marks Explain Mealy machine ? 3 marks NFA corresponding to the Closure of an FA 5 marks TGs: accepting all strings, accepting none, starting with b, not ending in b, containing aa, containing aa or bb…….. 5 marks |
![]() |
















Linear Mode


