Monthly Schedule

(MODD, Period D)

W 9/7/011

First day of school.

 

Th 9/8/011

HW due today: Send Mr. Hansen a signed e-mail from the address you check most frequently. See contact information.

 

F 9/9/011

HW due:

1. Try to solve the challenges at the bottom of the steganography handout.
2. Perform the following addition problems, showing your work. You can use the Windows Calculator to check your answers, but be sure to show your work.

 0xFAB
+0xBAC



 0xFADE
+0x0BFF



 0x310C
+0xA8B4



 

M 9/12/011

No class. Homework for Tuesday is posted below.

 

T 9/13/011

HW due: Use complement arithmetic to perform each subtraction. The first 4 are in decimal, and the second 4 are in hex. Show your work, and include some explanations.

 48
−37


 38
−67


 418
− 77


 2984
−3607


 0x31
−0x1A


 0x51
−0xDE


 0x310C
−0x18B4


 0x310C
−0xA8B4


 

W 9/14/011

HW due:

The truth table for the “implies” gate  is defined as follows:

A    B    A implies B
______________________
1    1         1
1    0         0
0    1         1
0    0         1


Prove that this is the same truth table that we get by evaluating  (In your writeup, show columns for A, ~A, and B, as well as the final result column.)

 

Th 9/15/011

HW due:

1. Using nothing but NAND gates, show how it is possible to combine 2 or more (as many as you wish, actually) in some clever way in order to make a gate that is equivalent to an AND gate. Let A and B denote the inputs, and prove that the output is equivalent to A AND B.

2. Show that if input A is fed into both inputs of a NAND gate, the output looks exactly like ~A. (In other words, you have found a way to use a NAND gate to mimic a NOT.)

3. Using nothing but NAND gates, construct a gate that is equivalent to an OR gate. Prove that your design works properly.

 

F 9/16/011

HW due:

Sleep! (Seriously, if you want to read up on the IEEE 754 floating-point formats for single and double precision, feel free. However, we will not be going into great depth on this topic.)

 

M 9/19/011

No class.

 

T 9/20/011

HW due:

1. Convert the following big-endian constant to little-endian byte order: 0xFABBC0D47832.
2. Convert each decimal constant below into IEEE 754 single precision format. Give answers in hex using standard big-endian byte order. Write a few sentences to describe your conversion process.
(a) –23.75
(b) 448.625

 

W 9/21/011

HW due:

Yesterday, we proved that


can be simplified to


which has a much smaller circuit diagram than the original. Simplify each of the following, giving your final answer in a format that uses only AND, OR, and NOT:

1.

2.

 

Th 9/22/011

HW due: Sleep and/or get caught up on previously assigned problems. No additional work is due.

 

F 9/23/011

No additional HW is due today.

In class: More practice with formal logic simplifications.

 

M 9/26/011

No class.

 

T 9/27/011

HW due: For review problems, redo some of the existing HW problems (with numbers altered slightly for variety), review your “bits, bytes, hex, and Hertz” notes, and prepare a short list of questions.

 

W 9/28/011

Test (100 pts.).

 

Th 9/29/011

HW due: Read pp. 1-27 (prologue and Chapter 1) of The Information. Reading notes are required (see HW guidelines for format). Notes can be brief.

 

F 9/30/011

HW due: Read through the end of p. 50 in The Information. Reading notes are required, as always.

 

 


Return to the MODD Zone

Return to Mr. Hansen’s home page

Return to Mathematics Department home page

Return to St. Albans home page

Last updated: 11 Oct 2011