| |
| 18-100_course_schedule_fall_2013 [2017/09/29 14:11] – external edit 127.0.0.1 | 18-100_course_schedule_fall_2013 [2021/11/22 03:42] (current) – edit |
|---|
| | | 10/24 | L17 | Sampling, analog to digital conversion, quantization, base conversions, binary arithmetic. | | | | 10/24 | L17 | Sampling, analog to digital conversion, quantization, base conversions, binary arithmetic. | |
| |10| 10/29 | L18 | Finish signal processing concept. Review for Exam II. | | |10| 10/29 | L18 | Finish signal processing concept. Review for Exam II. | |
| | | 10/31 | [[https://www.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L19.pdf |L19]] | Introduction to Computer Systems, begin basic assembly language. | | | | 10/31 | [[https://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L19.pdf |L19]] | Introduction to Computer Systems, begin basic assembly language. | |
| |11| 11/5 | ^ Exam II | | |11| 11/5 | ^ Exam II | |
| | | 11/7 | [[https://www.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L20.pdf |L20]] | Basic assembly language (cont.). | | | | 11/7 | [[https://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L20.pdf |L20]] | Basic assembly language (cont.). | |
| |12| 11/12 | [[https://www.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L21.pdf |L21]] | Logic gates, Boolean expressions, DeMorgan's theorems, begin combinational logic circuits. | | |12| 11/12 | [[https://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L21.pdf |L21]] | Logic gates, Boolean expressions, DeMorgan's theorems, begin combinational logic circuits. | |
| | | 11/14 | [[https://www.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L22.pdf |L22]] | Combinational logic circuits (cont.), truth tables, digital circuit schematics, two-level circuit representation. | | | | 11/14 | [[https://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L22.pdf |L22]] | Combinational logic circuits (cont.), truth tables, digital circuit schematics, two-level circuit representation. | |
| |13| 11/19 | [[https://www.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L23.pdf |L23]] | Karnaugh maps, adders, multiplexers, de-multiplexers. | | |13| 11/19 | [[https://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L23.pdf |L23]] | Karnaugh maps, adders, multiplexers, de-multiplexers. | |
| | | 11/21 | [[https://www.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L24.pdf |L24]] | Feedback in logic circuits, SR flip-flops, D flip-flops, master-slave edge-triggered flip-flops, sequential logic, state diagrams, state transition tables, begin finite state machine design. | | | | 11/21 | [[https://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L24.pdf |L24]] | Feedback in logic circuits, SR flip-flops, D flip-flops, master-slave edge-triggered flip-flops, sequential logic, state diagrams, state transition tables, begin finite state machine design. | |
| |14| 11/26| [[https://www.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L25.pdf |L25]] | Continue finite state machine design, design of counters, output mapping, sequential logic circuits with external inputs. | | |14| 11/26| [[https://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L25.pdf |L25]] | Continue finite state machine design, design of counters, output mapping, sequential logic circuits with external inputs. | |
| | | 11/28 | [[http://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L23.pdf |bonus]] ^ Thanksgiving (no class) | | | | 11/28 | [[http://users.ece.cmu.edu/~jhoe/course/ece100/F13handouts/L23.pdf |bonus]] ^ Thanksgiving (no class) | |
| |15| 12/3 | L26 | CIT Area Talks. Review for Exam III. | | |15| 12/3 | L26 | CIT Area Talks. Review for Exam III. | |
