EE231 COURSE OUTLINE
· Semester: Spring 2001 · Course: EE231, Ref #: 27920 · Text: Fundamentals of Logic Design, 4^{th} ed., Charles H. Roth, Jr. · Instructor: Richard Kolk; 674-3070, 647 0453, eMail: ric.kolk@carrier.utc.com · Class Times: M, W 5:35-6:50, room UT102
· Evaluation: 2 Exams (50%), Final (25%), Quizzes/Homework (25%) · Attendance: Regular attendance is expected, if you expect to be absent, please notify me in advance. |
· Course Overview: Introductory course in digital system logic covering number systems and codes, boolean algebra, circuit minimization, combinational and sequential circuit analysis ansd synthesis, medium scale integrated circuits, state machine tables and charts. |
SCHEDULE
Class |
Chap |
Sect |
Topics and [Problems] |
1/24 |
1 |
1,2 |
Number systems, conversions [3b, 3d] |
1/29 |
1 |
3,4 |
Binary Arithmetic, codes [9, 13a, 13b, 21] |
1/31 |
2 |
1-4 |
Boolean algebra, basic operations, expressions and truth tables, theorems [1b, 1d, 3b, 3d, 6a, 6b] - Quiz 1 |
2/5 |
Snow day |
||
2/7 |
2 |
4-7 |
Theorems, cummutative, associative, distributive laws, simplification theorems [9a, 9c, 12a, 12b, 15a, 15b] |
2/12 |
3 |
1,2 |
Inversion, duality [4a, 7a, 15b] – Quiz 2 |
2/14 |
3 |
3,4 |
Factoring, exclusive or, pos, sop, positive and neg logic [18] |
2/19 |
5 |
1,2,3 |
Conversion of sentences to boolean equations, n/w design using TT, min and maxterm expansions [2c, 4, 6] – Quiz 3 |
2/21 |
5 |
5 |
Incompletely specified functions [23b] |
2/26 |
6 |
1,2,3 |
Karnaugh maps (2,3,4 variable) [4,10] |
2/28 |
6 |
4 |
Minimal expressions using prime implicants [14] |
3/5 |
8 |
1,2,3 |
Multi level gate n/w (nand, nor) [2, 19] |
3/7 |
8 |
4 |
Two level nand, nor [23] |
3/12 |
Review |
||
3/14 |
Midterm Exam |
||
3/19 |
Spring Break |
||
3/21 |
Spring Break |
||
3/26 |
10 |
1 |
Combinational Logic |
3/28 |
20 |
1,2 |
Adders, Complement Arithmetic [2,3,8] |
4/2 |
9 |
4,5 |
Multiplexer, Decoder [14,19] |
4/4 |
No Class |
||
4/9 |
11 |
1,2 |
Timing diagrams, SR Flip Flop [1,3] |
4/11 |
11 |
3,4,5 |
T,JK Flip Flops [4, 13] |
4/16 |
13 |
3 |
State graphs and tables [4, 13, 14a] |
4/18 |
12 |
1,2 |
Counters; binary and other sequences [1c, 1d, 5] – Quiz 4 |
4/23 |
12 |
3,4 |
Counters using SR, JK [10c, 10d,13] |
4/25 |
No Class - Project |
||
4/30 |
12 |
3,4 |
Counters using SR, JK, [10c, 10d,13] |
5/2 |
13 |
1,2 |
Clocked Sequential Networks [2,5,9,11] |
5/7 |
Review - Project Due |
||
5/9 |
Final Exam |