Instructor: Victor P. Nelson, Broun 326, nelsovp@auburn.edu
Office Hours: MWF: 8:30-9:20; TH: 3:00-4:00
Class Meetings: MWF: 9:45 – 11:00, Broun 306
1. (Monday, May 23) – Number systems
Chapter 1: Text sections 1.1 – 1.3
· 1.1 (add/subtract/multiply only) – parts b,d,f,h
· 1.4 (skip octal) - Parts b,d,f: decimal to binary and decimal to hexadecimal
· 1.5 (skip octal) - Parts b,d,f binary to decimal and binary to hexadecimal (skip octal)
2. (Wednesday, May 25) – Number systems assignment (PDF), Reading: Chapter 1, sections 1.3 – 1.5
3. (Friday, May 27) – Two’s complement arithmetic and Boolean algebra (PDF), Reading: Chaps. 1.4, 2.1
4. (Wednesday, June 1) – Simplifying switching expressions (Word 2010 File) (PDF File with error), Reading: Chap. 2.1
5. (Friday, June 3) – Switching functions, Reading Chap. 2.2 – 2.6. From end of Chapter 2, work problems: 2.7(a,b,c), 2.16/18(a,b), 2.17/19(c), 2.20, 2.21 (Note that 2.16 and 2.18 go together, as do 2.17 and 2.19.)
6. (Monday, June 6) – Switching functions, Reading Chap 2.2 - 2.6. From end of Chapter 2, work problems: 2.29(a,b,c), 2.30(a,b,c), 2.23, 2.36.
7. (Wednesday, June 8) – Switching functions, Reading Chap. 2.2 – 2.6. From end of Chapter 2, work problems: 2.24 (Derive the switching expression for f(A,B,C,D) and then simplify it.)
2.32
(Similar to last class example from Monday – Example 2.23 in book.)
2.35 – Derive BOTH a 2-level NAND and a 2-level NOR circuit.
8. (Friday,
June 10) – (PDF File) Chapter 2 and
Chapter 3.1 – 3.3.
9. (Monday,
June 13). (Sent via email on 6/11/11) - From
the end of Chapter 3:
3.22(a)
and 3.27(a) - find BOTH minterm list and maxterm list.
3.31(a),3.33(a),3.40(a),3.45(a) - find BOTH minimal SOP and minimal
POS forms.
10. (Wednesday, June 15) – Chapter 3.6, 3.7. From
the end of chapter 3, work problems:
3.51(a)
and (b), 3.54(a) and (b) – find BOTH minimal SOP and minimal POS forms
3.38(a)
– find BOTH minimal SOP and POS forms
3.16
Friday, June 17
– MIDTERM QUIZ #1 (no homework)
11. (Wednesday, June 22) – Chapter 4.1 and 4.2
(decoders). Homework PDF file.
12. (Friday, July 1) – Chapter 4.2 – 4.6. Homework PDF file.
13. (Friday, July 1) – See #12 (problems in same
document)
14. (Wednesday, July 6) – Repeat selected problems
from HW 12-13. Homework PDF file.
15. (Friday, July 8) – Chapter 4.6, 4.8. Homework PDF file.
16. (Monday, July 11) – (Sent
via email on 7/10/11) Chapter 6, section 6.3. From the end of Chapter 6, work problems 6.4
and 6.5.
17. (Wednesday, July 13) – Chapter 6.3, 6.4. From the end of Chapter 6, work problems 6.7,
6.8, 6.11, 6.12, 6.13, 6.14.
Friday, July 15
– MIDTERM QUIZ #2 (no homework)
18. (Wednesday, July 20) – Registers (Chap. 6.4.4,
7.1) Homework PDF file.
19. (Friday, July 22) – Sequential circuit
analysis (Chap. 6.1, 8.1, 8.2). From the end of Chapter 8, work problems 8.1,
8.3, 8.7 (on this problem – find the state diagram first and then look at the
input/output sequences.)
20. (Monday, July 25) – Sequential circuit
analysis. (Chap. 8.2) From the end of Chapter 8, work problems 8.4, 8.5, 8.6,
8.10
21. (Wednesday, July 27) – Sequential circuit
synthesis (Chap. 8.3). From the end of Chapter 8, work problems:
8.18-8.19-8.20 (Same state table for all 3, but using different flip
flop types)
8.22
8.23 (6 states/state table rows, so more rows in the K-maps)
Note that these are all Mealy models, which require a “z” function.
22. (Friday, July 29) – Sequential circuit design
(Chap. 8). From the end of Chapter 8, work problems:
8.13 (a,b,c,d)
8.16 – Also, after finding the state diagram, synthesize the circuit
using JK flip flops.
8.25
Monday, May 30: Memorial Day
holiday
Thursday-Friday, June 23-24: No
class (MS-I reading day and final exams)
Monday, July 4: Independence
Day holiday
Friday, July 29: Classes End
Wednesday, August 3: Final Exam: 8:00 a.m. - 10:30 a.m.