> ‘Total No. of Page(s): 2 Roll No......... R B.E. (COE) _ B.E. MID SEM. EXAMINATION, SEPT.2012° : COE-402 : DCS - 1 _ Time: 1:30 Hrs. Max. Marks Note: Attempt ALL questions. 20 4: Give formal definition of synchronous sequential machine. What are capabilities and limitations of finite-state machine? 2. A long sequence of pulse enters synchronous sequential circuit which is required to produce an output pulse z=1, whenever sequence 1101 occurs. Design sequential deteathr to re the sequence 1101 jaw a state diagram elect an assignmeny 4nd show \the a and output A bles. AG Desisn the sequence Adteerot using T or D flip-flop. 3. Find the equivalence partition fir the machine shown in M ‘Table-1. IN in Shan ‘standard form of the corresponding reduced machine. ae meee a] yy: 2 Wieso 8 ear | A. wee ed | B BA oDte | Cc DO E,1 | D Co Fl E Rl Gg F Clisge G Cl eaeE H CO Alfal x given incompletely specified machine shown in Table-2. aminimum-state reduced machine containing the original o Table-2 C,. ce aC \C [b/Draw the state diagram and setae for traffic light controller. (Assume number of ig its). oO Cee * : ywRoll No: 299//; BE COE Mid Semester Examination, September 2012 COE 404:Theory of Automata & Formal Language 90 Min MM : 20 Attempt all questions. All questions carry equal marks. Find the Regular Expression for language accepted by following Finite State machine. <9 Construct a finite state Mealy machine that determines whether ae been read as the last eight characters in the input read so far, where the gph be any string of lowercase English letters and output will be 1 for acceptance ewe > Given the regular expression 0* 1((0+1)0*1 fe) ))*)+0(00)*. (@) Analyze it to find the | (b) Then draw the DFA, Consider the toy shown ahiioing Figure sicted by it.Roll No2-1.% [¢ a! 7) No. of Page(s): 1 B.E. (COE) B.E. MID SEM. EXAMINATION, SEPT.-2012 COE-405 : Artificial Intelligence Max. Marks: 20 Time: 1:30 Hrs. ie Note: Attempt ALL questions. < ial intelligence. Explain how a machine can be intelligent with suitable example. 2, at do you mean bf state space? What is advantage of using state space search? Explain with suitable example. rite the algorithm for de first*search. Is 8-puzzle problem can be solved using: ‘depth first search? If yes, then explain. a heya? What is is kéuristic function? oa any cone that can be ig Ma by using heuris' a ges? pep bat 18 prod tion’ s yatem? What are its agents Explain igh oukeable € exazaple- peed ao--"