Remember to check the ECE 120 Home page regularly for announcements.

Week	Date Activity (Lecture/ Discussion/ Lab/HW)	Topics /Weekly discussion-worksheet	Assigned reading		Lumetta slides and video (optional)	(Current lecture/slides) Additional materials
Week	Date Activity (Lecture/ Discussion/ Lab/HW)	Topics /Weekly discussion-worksheet	Patt & Patel textbook	Lumetta course notes	Lumetta slides and video (optional)	(Current lecture/slides) Additional materials

1	9/9 M Lecture 1	Overview and orientation; abstraction; computer systems organized as a systematic set of transformations	2nd Ed.: Ch. 1 3rd Ed.: Ch. 1	1.1	intro, abstraction layers, LEC-01 slides, instructor	intro, abstraction layers, philosophy notes, Prof. Bhowmik's Recording
	9/11 W Lecture 2	Representation using bits; unsigned integers and addition	2nd Ed.: 2.1, 2.2.1 3rd Ed.: 2.1, 2.2.1		representations and bits, unsigned representation LEC-02 slides, instructor	on-line tool Prof. Bhowmik's Lecture 2
	Discussion 1	Binary representation (worksheet)
	9/13 F Lecture 3	Modular arithmetic; 2's complement representation	2nd Ed.: 2.2-2.5 3rd Ed.: 2.2-2.5	1.2	modular arithmetic, 2's complement LEC-03 slides, instructor	on-line tool Prof. Bhowmik's Lecture 3
	Lab1	Introduction to Unix
	Homework 1	Abstraction and Binary Representation

2	9/16 M	Mid Autumn Festival
	9/18 W Lecture 4	Arithmetic operations and overflow; Boolean logic; logical completeness	2nd Ed.: 2.5-2.6 3rd Ed.: 2.5-2.6	1.3, 1.4	boolean logic, logical completeness LEC-04 slides, instructor	extra slides on-line tool Prof. Bhowmik's slides
	Discussion 2	Binary arithmetic (worksheet)
	9/20 F Lecture 5	Fixed- and floating-point representation; Hexadecimal notation, text, and terminology for representations	2nd Ed.: 2.7 3rd Ed.: 2.7		fixed and floating point, terminology and text, extra_slides LEC-05 slides, instructor	on-line tool Prof. Bhowmik's slides
	Lab 2	Introduction to C programming
	Homework 2	Arithmetic, logical operations and representations

3	9/23 M Lecture 6	C programming: Expressions and operators		1.5	introduction to C, expressions and operators LEC-06 slides, instructor	C code examples
	9/25 W Lecture 7	C programming: Basic I/O, control structures in C		1.5	basic I/O, statements LEC-07 slides, instructor	circle.c travel.c lines.c mystery5.c C code examples
	Discussion 3	Problem solving with C (worksheet)
	9/27 F Lecture 8	C programming: Program execution, program analysis, program testing		1.5 1.6	program execution, program analysis, testing programs LEC-08 slides, instructor (NO SOUND) sum_of_power2.c	binary_conv.c on-line tool fun with floating point, bit manipulation
	Lab 3	Intro to digital logic design with Xilinx Vivado software
	Homework 3: First Attempt	Introduction to C programming

4	9/29 F Lecture 9	CMOS and logic gates; optimizing logic expressions	2nd Ed.: 3.1-3.2 3rd Ed.: 3.1-3.2	2.1.1	logic gates, optimizing logic expressions LEC-09 slides, instructor	on-line tool
4	9/30 M Lecture 10	Boolean algebra terminology, canonical forms; Karnaugh maps		2.1.2-2.1.4	Boolean terminology, Karnaugh maps LEC-10 slides, instructor	on-line tool

National Day Holiday

5	10/9 W Lecture 11	Logical completeness and two-level design;		2.1.5-2.1.6	two level logic, pareto optimization LEC-11 slides, instructor	on-line tool
	Discussion 4	Karnaugh maps and function minimization (worksheet)
	10/11 F Lecture 12	Boolean properties; don't care simplification		2.2	Boolean properties, don't cares, caring and glue logic LEC-12 slides, instructor
	10/12 M Lecture 13	Combinational logic structures: ripple-carry adder; bit-sliced design		2.3	ripple-carry adder, bit-slicing LEC-13 slides, instructor	AL2: BCD-to-7Seg
	Lab 4 Hardware Lab	Digital Logic Lab with TTL microchips
	Homework 3: Corrections
	Homework 4: First Attempt	CMOS logic, Boolean expressions, minimization

6	10/14 M Midterm 1	Midterm1 (Link)			Mock Test	ece198jl_sp13_exam1.pdf (ece198jl_sp13_exam1_solutions.pdf) ece120sp16_mt1.pdf ece120fa16_mt1.pdf (ece120fa16_mt1_solution.pdf)
	10/16 W Lecture 14	Combinational logic structures: bit-sliced comparator		2.4	bit-sliced comparator, optimizing the comparator, 2's complement comparator LEC-14 slides, instructor
	Discussion 5	From problem statement to digital circuit (worksheet)
	10/18 F	Sports Meet
	Lab 5	Combinational logic design with Xilinx Vivado
	Homework 5: PL	Boolean algebra and two-level design

7	10/21 M Lecture 15	Abstraction in design		2.5.1-2.5.3	power-of-2 checker, building with abstraction, checking for upper case LEC-15 slides, instructor
	10/23 W Lecture 16	Combinational logic structures: decoders, muxes	2nd Ed.: 3.3 3rd Ed.:3.3	2.5.4	multiplexers, decoders LEC-16 slides, instructor
	Discussion 6	Bit-sliced design (worksheet)
	10/25 F Lecture 17	Storing a bit: latches and flip-flops		2.6	storing a bit, the clock abstraction LEC-17 slides, instructor (BROKEN VIDEO)
	Lab 6 Hardware Lab	Combinational logic implementation with TTL
	Homework 6: First Attempt	Design of combinational logic circuits

8	10/28 M Lecture 18	Static Hazards; shift registers, registers with parallel load		2.7 2.8	static hazards, registers LEC-18 slides, instructor
	10/30 W Lecture 19	Serialization·		3.1.1 - 3.1.2	serialization, example of serialization, second example of serialization LEC-19 slides, instructor	FOUR_BIT_SERIAL_Comparator.pdf
	Discussion 7	Sequential circuits (worksheet)
	11/1 F Lecture 20	Finite state machines; binary counters		3.1.3 - 3.1.7	finite-state machines, binary counters LEC-20 slides, instructor	(Traffic_Signal.pdf )
	Lab 7	Sequential logic implementation with Xilinx Vivado
	Homework 6: Corrections
	Homework 7: First Attempt	Sequential logic elements

9	11/4 M Lecture 21	FSM models; Clock synchronous design		3.2	machine models, fsm design process, color sequencer LEC-21 slides, instructor
	11/6 W Lecture 22	FSM design for Lab 7/8		LabFSM	design of the lab fsm
	Discussion 8	Shift registers and counters (worksheet)
	11/8 F Lecture 23	Modular FSM design		3.4	extending keyless entry LEC-23 slides, instructor
	Lab 8 Hardware Lab (Final)	Sequential logic implementation with TTL (Round 1: Extra Credit)
	Homework 7: Corrections
	Homework 8: First Attempt	Sequential logic, synchronous design

10	11/11 M Lecture 24	Modular FSM design		3.5	vending machine (cont.) LEC-24 slides, instructor
	11/13 W Lecture 25	Concept of memory		3.6	memory LEC-25 slides, instructor
	Discussion 9	FSM design (worksheet)
	11/15 F Lecture 26	From FSM to computer		3.7 3.8	from fsm to computer LEC-26 slides, instructor
	Lab 8 (cont'd) Hardware Lab (Final)	Sequential logic implementation with TTL (Round 2: Normal Credit)
	Homework 8: Corrections
	Homework 9: First Attempt	FSM design and implementation

11	11/18 M Lecture 27	The von Neumann model: basic components, instruction cycle	2nd Ed.: 4.1-4.2 3rd Ed.: 4.1-4.2		von neumann model, lc-3 as von neumann LEC-27 slides, instructor
	11/20 W Lecture 28	Instruction formats and instruction processing	2nd Ed.: 4.3-4.5 3rd Ed.: 4.3		instruction formats, instruction processing LEC-28 slides, instructor	slides(UKB)
	Discussion 10	Storage elements (worksheet)
	11/22 F Midterm 2	MockTest (link)			Spring 2016 midterm 2 (SOLUTION). Ignore Problem 1.2(a)(ii) and Problem 6.2 (6.1 is a register, and similar problems may appear on your exam; 6.2 treats the same circuit as an FSM). For 2.2(a)'s solution, drop the word "logical." Fall 2016 midterm 2 (SOLUTION ). Spring 2017 midterm 2 (SOLUTION). Fall 2017 midterm 2 (SOLUTION ).
	Lab 9	Introduction to LC-3 binary coding and tools
	Homework 9: Corrections
	Homework 10: First Attempt	Component-based FSM Design; Memory

12	11/25 M Lecture 29	LC-3 ISA	2nd Ed.: Ch. 5 3rd Ed.: Ch. 5		instructions illustrated, the lc-3 isa LEC-29 slides, instructor
	11/27 W Lecture 30	LC-3 binary program analysis: counting to 10			counting to ten, codes LEC-30 slides, instructor	counting-example.pdf
	Discussion 11	LC-3 instructions (worksheet)
	11/29 F Lecture 31	Programming in LC-3 machine language: typing a number			typing in a number, computers are dumb LEC-31 slides, instructor	readnum.bin
	Lab 10	Programming in LC-3 machine language
	Homework 10: Corrections
	Homework 11: First Attempt	The Von Neumann Model; LC-3 ISA and programming in binary machine language

13	12/2 M Lecture 32	Problem solving using systematic decomposition; Good design	2nd Ed.: Ch. 6 3rd Ed.: Ch. 6		systematic decomposition, good design LEC-32 slides, instructor
	12/4 W Lecture 33	Programming example: letter frequency counter			letter frequency planning, letter frequency decomposition, letter frequency coding LEC-33 slides, instructon	letterfreq.bin
	Discussion 12	Programming in LC-3 machine language (worksheet)
	12/6 F Lecture 34	Introduction to LC-3 assembly language; the assembly process	2nd Ed.: Ch. 7 3rd Ed.: Ch. 7		assembly language, assemblers LEC-34 slides, instructor	Prof. Bhowmik's Slides letterfreqasm.asm (code)
	(code)Lab 11	Introduction to LC-3 assembly and tools
	Homework 11: Corrections
	Homework 12: First Attempt	LC-3 Programming in binary machine language

14	12/9 M Lecture 35	LC-3 assembly programming: ASCII screen art example			screen art, ascii-art.asm, ascii-art2.asm, fake.asm, rahul-msg.asm LEC-35 slides, instructor	Slide (UKB)
	12/11 W Lecture 36	Design of the LC-3 datapath; fetch and decode execution	2nd Ed.: C.3 3rd Ed.: C.3	4.1.1-4.1.3	lc-3 control signals, lc-3 fetch control signals LEC-36 slides, instructor	Lc-3-control-signals-Class(Prof. Bhowmik).pdf
	Discussion 13	Systematic decomposition and LC-3 assembly programming (worksheet)
	12/13 F Lecture 37	LDI control signals example; hardwired control unit design		4.1.4-4.1.5	lc-3 LDI control signals, hardwired control unit design LEC-37 slides, instructor
	Lab 12	Programming in LC-3 assembly language 1
	Homework 12: Corrections
	Homework 13: First Attempt	LC-3 programming in assembly

15	12/16 M Midterm 3	MOCK TEST (link)	Practice Exams Spring 2016 midterm 3 (solution). Ignore Problem 3. (T-flip flops won't be on the exam!) Fall 2016 midterm 3 (solution ). Spring 2017 midterm 3 (solution ) Fall 2017 midterm 3 (solution ) We discourage you from simply looking at the solutions without having tried the exams under test conditions because research shows that students who check their answers too quickly tend to perform worse during the actual exam.			Content of Exam Midterm 3 will consist of ZJUI-Learn based Questions. It will cover the course material from Lecture 19 through Lecture 30 (as listed on the detailed schedule page), including Discussions 8-11, Homework 8-11, and Labs up to and including 9. For a list of specific terminology and topics, see Lumetta course notes 3.8: Summary of Part 3.
	12/18 W Lecture 38	Microprogrammed control unit design; the Patt and Patel control unit	2nd Ed.: C.1-C.4 3rd Ed.: C.1-C.4	4.1.6	microprogrammed control unit design, patt and patel control unit, extending lc3 isa LEC-38 slides, instructor	lecture38_intro_print.pdf MicroSequencer_Lecture(Prof. Bhowmik)-Video Recording Add a New Instruction to LC3-ISA Microsequencer-FA23
	Discussion 14	LC-3 datapath control (worksheet)
	12/20 F Lecture 39 Lecture 40	Error Detection and Correction, Overview and advice		4.2	error detection, parity and hamming distance, error correction and hamming codes LEC-39 slides, instructor summary, advice, final exam FIN review: slides, instructor
	Lab 13	Programming in LC-3 assembly language 2
	Homework 13: Corrections
	Homework 14	LC-3 datapath and control word			No corrections will be graded. Study solutions on your own
Final Exam (MockTest) MockTest (Solution)
16	Discussion 15	LC-3 control unit (self-study)** (worksheet) Discussion15-solution.pdf (Very important)
16	Final Exam	Final (Regular): 12/29		Practice Exams Spring 2016 final (solution). Ignore Problem 3. Fall 2016 final (solution). Spring 2017 final (solution). Final Exam (MockTest) MockTest (Solution)		Content of Exam: The final exam will consist of PraireLearn based Questions. It will cover the entire course material from Lecture 1 through Lecture 38, including Discussions 1-15, Homeworks 1-14, and Labs 1-13. Slightly more emphasis will be placed on the new material since Midterm 3. Error detection, error correction, Hamming distance and Hamming codes will not be on the Exam. For a list of specific terminology and topics, see: Lumetta course notes 1.6: Summary of Part 1. Lumetta course notes 2.8: Summary of Part 2. Lumetta course notes 3.8: Summary of Part 3. Lumetta course notes 4.4: Summary of Part 4.