Digital Logic
“The best thing about a Boolean is even if you are wrong, you are only off by a bit.”
- unknown
All assignments are in Canvas
B |
C |
F |
H |
Topics and Resources |
M 11/3 |
T 11/4 |
W 11/5 |
W 11/5 |
Describe the truth
tables of AND, OR, NAND, NOR, XOR, and NOT gates Translate between
simple Boolean expressions, truth tables, and logic circuits MrH Podcast - Logic Gates (12 min) |
W 11/5 |
W 11/5 |
Th 11/6 |
Th 11/6 |
Implement simple
combinational circuits MrH Podcast - Intro to Logisim (2
min) |
Th 11/6 |
Th 11/6 |
F 11/7 |
F 11/7 |
Apply the
principle of abstraction to assemble circuits from replications of simpler
ones Apply the method of
“OR of ANDs” to design more complex circuits |
F 11/7 |
M 11/10 |
M 11/10 |
M 11/10 |
MrH Podcast - OR
of ANDs (4 min) Work on Lab |
W 11/12 |
W 11/12 |
W 11/12 |
W 11/12 |
L1: Simplify Boolean
expressions to simplify circuits |
Th 11/13 |
Th 11/13 |
Th 11/13 |
F 11/14 |
Finish Lab 2-2 |
F 11/14 |
F 11/14 |
F 11/14 |
M 11/17 |
Explain how a
flip-flop (set-reset latch) circuit works Build a simple
memory circuit using SR flip-flops |
M 11/17 |
M 11/17 |
T 11/18 |
T 11/18 |
Work on 2-3 |
T 11/18 |
T 11/18 |
W 11/19 |
W 11/19 |
Finish up labs |
W 11/19 |
W 11/19 |
Th 11/20 |
Th 11/20 |
Review for Quiz |
Th
11/20 |
F 11/21 |
F 11/21 |
F 11/21 |
Quiz on Digital Logic |
More Resources for this Unit…
Intro to Digital Logic – From Bucknell’s Exploring Electrical Engineering course; see especially Gates, and Minterms (Or of Ands), Flip-Flops and Memory
Course
Units |
Course Resources |
WHS Links |
|
||
|
||
|
|
|
|
|