COMP SCI 252 Midterm: CS 252 UW Madison Spring2013 Exam2A SOL
Document Summary
Prof. mark d. hill and prof. gurindar sohi. Tas: rebecca lam, preeti agarwal, mona jalal, pradip vallathol. No: book(s), note(s), or calculators of any sort. Plan your time carefully since some problems are longer than others. For the following questions, select the best answer. Build a 3-bit adder from three 1-bit adders. The 3-bit inputs are x2x1x0 and y2y1y0 and the. Assume x0, y0, z0 are the least significant bits and x2, y2, z2 are the most significant bits. Fill the boxes in the figure below with the appropriate variable names and make connections if and when required. Note: in each 1-bit adder, a and b are the inputs, cin is the carry-in, cout is the carry-out and. Design a finite state machine (fsm) that recognizes the pattern "101" among a sequence of input bits (in). When the fsm has "101" as inputs in successive bits, it should output 1. The bits are read from left to right.
