Monthly
Schedule
(MODD,
Period D)
W
9/7/05 |
First day of class:
Introduction, ground rules, and discussion of course
announcement and proposed course outline. |
|
|||
Th
9/8/05 |
HW due:
Mark up the proposed course outline to
add any topics you feel are missing, or to delete any topics you are not very
interested in. |
|
|||
F
9/9/05 |
HW due:
Using only the components of AND
gates, OR gates, and inverters, design a circuit that has the behavior shown
in this table. |
|
|||
|
|
first input |
second input |
desired output |
|
|
|
1 |
1 |
1 |
|
|
|
1 |
0 |
0 |
|
|
|
0 |
1 |
1 |
|
|
|
0 |
0 |
1 |
|
M
9/12/05 |
HW due:
Simplify each of the following expressions, using rules of Boolean algebra: |
|
|||
T
9/13/05 |
HW due (this one will be collected): Simplify each of the following expressions, using
rules of Boolean algebra: |
|
|||
W
9/14/05 |
HW due:
Negate each of the following, and write the answer in English. For political
neutrality, let N be the set of
nincompoops, and let S be the set
of silly people. Note that we actually did the first one correctly at the end
of class. At first, I thought it was wrong, but I forgot that of course we
were negating the meaning of the
initial statement. The first one is essentially done for you, but rewrite it
for practice, showing your work in the part where you obtain the negation.
The rule is that the ~ (negation symbol) affects the part of the statement
after the colon ( : ), but only after flipping $ to " or vice versa. |
|
|||
Th
9/15/05 |
HW due:
Make two fairly difficult puzzles, one that requires the person solving the puzzle
to convert a circuit diagram into symbols, and one that requires converting
symbols into a circuit diagram. Be sure to use all the components and symbols
you can think of (AND, OR, NOT, XOR, XNOR, Þ, etc.). |
|
|||
F
9/16/05 |
HW due:
Read about Gödel’s Theorem
and be prepared for a graded discussion. You may wish to make a few
handwritten notes. |
|
|||
M
9/19/05 |
HW due: If
you already did the reading assigned for Friday (Gödel’s Theorem), then
relax—you have a weekend with no homework. Otherwise, you need to do the
reading and write a paragraph (3 or 4 sentences) summarizing the theorem in
your own words. Try to work the words complete
and consistent into your paragraph. |
|
|||
T
9/20/05 |
Unit Quiz
on Logical Building Blocks (topics 0x01–0x0F). |
|
|||
W
9/21/05 |
HW due:
Get a good night’s sleep. |
|
|||
Th
9/22/05 |
HW due:
Get a good start on the HW due tomorrow. |
|
|||
F
9/23/05 |
HW due: In
the textbook (distributed in class Wednesday), read pp. 135-137, especially
Figure 3-17. Write p. 641 #1-4 all, 7ab (omit the two subtractions). For
#7ab, do each addition 3 ways: in binary, in octal, and in hexadecimal.
Finally, write your last name in hex, following ASCII rules. How many bytes
are required? How many bits? |
|
|||
M
9/26/05 |
HW due:
Read pp. 633-637. Reading notes are required (see HW
requirements page, which includes a description of how to make reading
notes). |
|
|||
T 9/27/05 |
HW due:
Scavenger hunt from yesterday. |
|
|||
W
9/28/05 |
HW due:
Find out the bandwidth (i.e., speed in bits per second) of your home Internet
service provider. Since the actual figure varies, you may wish to visit a
site on the Internet that computes the speed by testing. An easier, safer way
is to time how long it takes to download a file of known size from a site
that is known to be safe (e.g., windowsupdate.microsoft.com), and then
compute the speed in bits per second based on the number of bytes that were
downloaded.. |
|
|||
Th
9/29/05 |
Unit Quiz
on Bits, Bytes, Hex, and Hertz (topics 0x11–0x1F). |
|
|||
F 9/30/05 |
The term “digital” refers
to any device or process that considers integers as its fundamental units.
For example, a cash register is digital—even an old-fashioned mechanical cash
register—because it deals in quantities of whole pennies. You can’t purchase
something for p dollars. The number of pennies is always an integer. In math, we
would call this a discrete function
or a discrete process. |
|
Return to Mr. Hansen’s home page
Last updated: 06 Oct 2005