Individual Homework 1 -- EECS 270, Spring '23

Due Monday, May 8th, @9pm on Gradescope. 5% off if turned in by 11pm. No credit after that.


This assignment is worth about 1% of your grade in the class and is graded out of 30 points. Remember you may drop one individual homework assignment.

'+'=OR, '*'=AND, '!'=NOT and '^' is XOR.


  1. Write the truth table for the logical statement (!A*C)+(A*!B*!C)+(B*C). [3]
  2. 2.23 but instead for the function F=!a*b+!a*b+a*c*!d+!b [2]
  3. Convert the function shown in Table 2.11 into the canonical sum-of-products form.[2]
  4. Using the rules of logic, show that (!a*!c+!b)*c+!(a*b) = !(a*b). Show each step as was done in example 2.13 on page 57. [3]
  5. Draw a logic circuit which is identical to !((x*!y)+z). [2]
  6. Problem 2.52. For part a, again show each step. [5]
  7. Problem 2.54. [3]
  8. Problem 2.60 -- let the binary number be N[4:0], so N4 is the most signifiant bit and N0 the least significant bit.. [3]

    These questions we may not have covered by the time the homework is due. They are fairly simple, but you may need to look in the text or on the web to do them. Most of your homework assignments will have a few questions like this!

  9. Perform a bitwise AND of the following two strings 10101 and 01100. [2]
  10. Convert the following numbers into hexadecimal (base 16). You need to be able to do these without a calculator/computer/etc. [3]
    1. 1210
    2. 1810
    3. 128
    4. 1001012
    5. 5718
  11. What distinguishes combinational logic from sequential logic? [2]