Difference between revisions of "CSC231 Homework 2 2010"

From dftwiki3
Jump to: navigation, search
(→‎Problem #1)
(→‎Problem #2)
Line 27: Line 27:
  
 
=Problem #2=
 
=Problem #2=
 +
 +
* Complete the table below which shows the equivalent representations of unsigned integers in binary, hexadecimal, and decimal.
 +
Use as many bits are required. 
 +
 +
{|
 +
! Decimal
 +
! Hexadecimal
 +
! Binary
 +
|-
 +
| 17
 +
| 11
 +
| 00010111
 +
|-
 +
| 135
 +
|
 +
|
 +
|-
 +
| 1001
 +
|
 +
|
 +
|-
 +
|
 +
| FF
 +
|
 +
|-
 +
|
 +
| A01
 +
|
 +
|-
 +
|
 +
| FFFF
 +
|
 +
|-
 +
|
 +
|
 +
| 1111 1000 1001 1000
 +
|-
 +
|
 +
|
 +
| 1 1111
 +
|-
 +
|
 +
|
 +
| 1000 1000 1000 1000 1000 1000 1000 1000
 +
|}

Revision as of 15:41, 22 September 2010

--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. Make sure you draw accurately the AND, OR, EXOR, or NOT gates. Put the part number inside or next to the gate, and add the pin numbers.
  • 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

  • Complete the table below which shows the equivalent representations of unsigned integers in binary, hexadecimal, and decimal.

Use as many bits are required.

Decimal Hexadecimal Binary
17 11 00010111
135
1001
FF
A01
FFFF
1111 1000 1001 1000
1 1111
1000 1000 1000 1000 1000 1000 1000 1000
Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC231_Homework_2_2010&oldid=8148"