\n"); } else { header("Content-type: text/html; charset=utf-8"); } ?> CS-343 Assignment 2

Reading

Assignment

In class we developed a truth table for the next state function of our day-of-week state machine:

Present State Next State
S2 S1 S0 S2 S1 S0
000001
001010
010011
011100
100101
101110
110000
111000

Study the Minimization Tutorial above, and then answer the following questions:

  1. Draw a logic network that implements the entire truth table using the unminimized sum of products implementation.
  2. Tell the gate input count for the unmimimized network.
  3. Determine the mimimized equations for the three functions using algebraic minimization. Show all work.
  4. Minimize the functions again using Karnaugh Maps. Be sure the results are the same as for algebraic mimization. Show all work.
  5. Draw the logic network that implements the minimized functions.
  6. Tell the gate input count for the minimized network.
  7. Is there any speed difference between the two implementations? If yes, how much?

Submit the Assignment

Write your name and your answers to the questions on a piece of paper and bring it to class on the due date. If you did the assignment with someone else, put both names on a single copy of the answers (rather than submitting the answers twice).

Solution