Lecture
notes and videos for CpE 100 Computer Logic Design I, Spring 2021
May 10 – final exam (comprehensive), 6 to 8 PM, open book and closed notes (practice_final)
May 5 – lec27_cpe100.pdf and lec27_cpe100_video – review for the final exam
May 3 – lec26_cpe100.pdf and lec26_cpe100_video – introduction to computer architecture. Read Secs. 6.1-6.4. (q23)
April 28 – lec25_cpe100.pdf and lec25_cpe100_video – logic arrays including PLAs and FPGAs. Read Sec. 5.6. (q22)
April 26 – lec24_cpe100.pdf and lec24_cpe100_video – types of memory, counters, multiplication, and number systems. Read Sec. 5.4 (q21)
April 21 – lec23_cpe100.pdf and lec23_cpe100_video – continue memory arrays including register files (RF). (q20)
April 19 – lec22_cpe100.pdf and lec22_cpe100_video – introduction to memory arrays and row/column decoders. Read Sec. 5.5 (q19)
April 14 – lec21_cpe100.pdf and lec21_cpe100_video – comparators, shifters, rotators, and the arithmetic logic unit (ALU). Read Sec. 5.3 (q18)
April 12 – lec20_cpe100.pdf and lec20_cpe100_video – work problem 1 of hw#16. (q17)
April 7 – lec19_cpe100.pdf and lec19_cpe100_video – work examples of arithmetic circuits. (q16)
April 5 – lec18_cpe100.pdf and lec18_cpe100_video – arithmetic circuits including full- and half-adders. Read Sec. 5.1-5.2 (q15)
March 31 – lec17_cpe100.pdf and lec17_cpe100_video – work even more state machine examples. (q14)
March 29 – lec16_cpe100.pdf and lec16_cpe100_video – continue with state machine example. (q13)
March 24 – lec15_cpe100.pdf and lec15_cpe100_video – Moore and Mealy state machines, start example. Read Sec. 3.4 (q12)
March 22 – lec14_cpe100.pdf and lec14_cpe100_video – review D-Flip-Flop (DFF) operation, ring oscillators, race conditions. Read Sec. 3.3
March 15 and 17 – Spring break from instruction
March 10 – Midterm exam, open book and closed notes (midterm_cpe100_s21.pdf)
March 8 – lec13_cpe100.pdf and lec13_cpe100_video – review for the midterm exam
March 3 – lec12_cpe100.pdf and lec12_cpe100_video – introduction to flip-flops, simulation examples. Re-read Sec. 3.2 (q11)
March 1 – lec11_cpe100.pdf and lec11_cpe100_video – introduction to latches, simulation examples. Read Secs. 3.1-3.2 (q10)
February 24 – lec10_cpe100.pdf and lec10_cpe100_video – combinational building blocks. Read Sec. 2.8 (q9)
February 22 – lec9_cpe100.pdf and lec9_cpe100_video – more Karnaugh maps. Read Sec. 2.7 (q8)
February 17 – lec8_cpe100.pdf and lec8_cpe100_video – implementing logic with gates, even more boolean algebra, Karnaugh maps. Read Secs. 2.4-2.6 (q7)
February 15 – no lecture, Presidents' day
February 10 – lec7_cpe100.pdf and lec7_cpe100_video – combinational logic, boolean equations, more boolean algrebra. Read Secs. 2.1-2.3 (q6)
February 8 – lec6_cpe100.pdf and lec6_cpe100_video – truth tables, simulating logic gates. start boolean algebra. Read Sec. 1.7 (q5)
February 3 – lec5_cpe100.pdf and lec5_cpe100_video – logic gates (inverter, NAND, NOR, XOR), introduction to the transistor as a switch. Read Secs. 1.6 (q4)
February 1 – lec4_cpe100.pdf and lec4_cpe100_video – more two's complement, introduction to the inverter. Read Secs. 1.5 (q3)
January 27 – lec3_cpe100.pdf and lec3_cpe100_video – binary addition, signed binary numbers, two's complement numbers. Read Secs. 1.4.5-1.4.6 (q2)
January 25 – lec2_cpe100.pdf and lec2_cpe100_video – continue octal and hexidecimal numbers, simple simulations. Read Secs. 1.4.3-1.4.4 (q1)
January 20 – lec1_cpe100.pdf and lec1_cpe100_video – course introduction, binary numbers, start octal and hexidecimal numbers. Read Secs. 1.1-1.3, and Secs. 1.4.1-1.4.2