CSC231 Homework 2 2010

From dftwiki3
Revision as of 16:36, 22 September 2010 by Thiebaut (talk | contribs) (Created page with '--~~~~ ---- <center> <font size="+2">Page under construction!</font> <br \>300px </center> __TOC__ <br /> <br /> <br /> <br /> =Problem #1= *…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

--D. Thiebaut 20:36, 22 September 2010 (UTC)


Page under construction!
UnderConstruction.jpg





Problem #1

  • Design a 4-bit adder.
  • Each input bit has the same weight.
  • Generate the boolean expressions for the bits that represent the sum of the 4 bits.
  • Draw the schematics for the least significant output bit. You do not need to draw the schematics for all the bits, just the least significant one.
  • Either scan, take a picture, or use a drawing/CAD package to create an electronic version of your diagram.
  • Create a pdf that will contain all the answers to Problem #1. Call this pdf hw2.pdf, and submit it as follows:
  submit hw2 hw2.pdf

Problem #2