blanksolutionsEE 200 Midterm Exam 26 March 2013Last Name (Print):First Name (Print):ID number (Last 4 digits):Section:DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SOProblem Weight Score1 202 253 254 30Total 100INSTRUCTIONS1. You have 2 hours to complete this exam.2. This is a closed book exam. You may use one 8 .5”× 11” note sheet.3. Calculators are al lowed.4. Solve each part of the problem in the space following the question. If you need more space, continue your solutionon the reverse si de lab eling the page with the question number; for example, Problem 1.2 Continue d. NOcredit will be given to solutions that do not meet this requirement.5. DO NOT REMOVE ANY PAGES FROM THIS EXAM. Loose papers will not be accepted and agrade of ZERO will be a ssigned.6. The quality of your analysis and evaluation is as important as your answers. Your reasoning must be preciseand clear; your complete English sentences should convey what you are doing. To receive credit, you mustshow your work.1Problem 1: (20 Points)From Monday March 18 through Friday March 29, the Penn State Urban Gaming Club is spo nsori ng the 2013Humans vs. Zombies (HvZ) contest. Quoting directly from the Urban Gaming Club web page: HvZ comes back toPenn State f or an awesome zombie stunning and human surviving time! Meet new friends in the fight f or survival,and bond over the hunting of human cranium! This problem requires you to apply your k nowledge of finite statemachines to construct a state diagram and state table that models zombie behavio r.For your analysis, assume that zombies are either roami ng, hunting huma ns, or evading humans. Further a ssumethat zombies respond to only two binary inputs. The first input, prey present, is true when delectable humans arewithin reach, or false of if there are no humans present. The second input, threat present, is true when the zombie isbeing chased by an army of humans. On every tick of the clock, the zombie decides whether to roam, hunt, or evadedepending upon the two binary inputs i t perceives.Suppose a zombie starts out roaming. If on the next clock tick prey is present, and no threats a re present, the zombiebegins to hunt humans. If on the other hand a threat is present, regardless of whether or not prey is present, thezombie will begin to evade humans. If neither prey nor threats are present, the zombie continues to roam.Once the zombie begins to evade humans, it will continue to do so on each tick of the clock until the threat input isno longer true. Once the threat input is false, the zombie wi ll either begin to roam or hunt, depending on whetheror not prey is present.Once the zombie begins to hunt humans, it will continue to do so until either the prey is no longer present, becauseit escaped or was devoured, or a threat is sensed. If prey is no longer present and there are no threats, the zombiewill stop hunting and starting roaming. On the other hand, if the zombie senses a threat, it will stop hunting, evenif prey is present, and it will start eva ding humans.Assume that the group of humans includes an electrical engineer who has placed a transmitter on the zombie. Thisdevice continuously transmits a sequence of two bi ts that describes the current actions of the zombie. The transmittersends 00 when the zombie is roaming, 01 when the zombie is evading humans, and 10 when the zombie is huntinghumans.21. (10 points) Represent the inputs prey present and t hreat present by the binary variables P a nd T . Represent thestates of the zombie as roaming (R), hunting humans (H), and evading humans (E). Represent the behaviorof the zombie using a Moore finite state machine by sketching the state diagram. To receive full credit, labelthe states as R, H, and E, the inputs as P and T , and appropria tely specify the output (transmitted binarysequence) for each state.32. (10 poi nts) Construct a state table with columns labeled present s tate, input, next state, and output.4Problem 2: (25 Points)1. (8 points) Figure 1 shows the state diag ram for a Moore finite state machine with input x and output y.Figure 1: State diagram for a Moore finite state machine.Compl ete the state table for the Moore machine in Figure 2.Figure 2: State table for the Moore finite state machine.52. (9 points) Figure 3 shows the state table for another Moore finite state machine with input x and outputy. Suppose we implement the finite state machine with D-type flip-flops. Using the state table in Figure 3,determine expressions f or the flip-flop inputs DAand DB, and the system output y, in terms of x, QA, andQB. To receive credit, use Figure 4 as a guide a nd show the three-varia ble Karnaug h map used to derive eachexpression.Figure 3: State table for a Moore finite state machine.Figure 4: Three variable Karnaugh map6783. (8 points) For a certain digital design, in terms of the signals A, B, a nd C, the output y i sy = ABC +¯ACDraw a circuit diagram that uses two-input NAND gates and generates the output y using A, B, and C asinputs. Do not use¯A,¯B or¯C as inputs to your logic circuit.9Problem 3: (25 Points)1. (15 poi nts) Once again consider a finite state machine with input x, output y, and the state table in Figure 5.Using the CUPL state machine syntax, write data flow code for i mplementing this finite-state machine usingthe ATMEL 750 C L programmable log ic device. Assign the clock to pin 1, the input to pin 2 and the outputto pin 23. Set the reset (clear) and set input of all D-type flip-flops to zero. Label the output of the D-typeflip-flops in the da ta flow code as QA and QB. Denote the state QAQB= 00 as S0, QAQB= 01 as S1,QAQB= 1 0 as S2, and QAQB= 1 1 as S3. Do not include the header information in your code, but you mustinclude comment lines to improve the readability of your code.Figure 5: State table for a Moore finite state machine.10112. (10 points) A student wishes to realize the circuit in Figure 6 using the single layer printed circuit boa rd inFigure 7.Figure 6: Circuit diagram for a finite state machine implemented using the AT MEL 750CL programmable logicdevice.Figure 7: Realization of the circuit using a single copper layer on top of the printed circuit board.12(a) (5 points) Is the printed circuit board layout consistent with the circuit diagram in Fi gure 6? If not, statethe differences.(b) (5 points) Regardless of whether or not the circuit layout is consistent with the circuit di agram, the studentrequests that you critique their design in Figure 7 with