ENEE244-02xx: Digital Logic Design Fall 2014 Homeworks

• Homework 1, due in class on Sept. 11
Exercises: 2.3(c),(d); 2.4(c),(d); 2.5(a),(b); 2.6(a),(b); 2.11(a),(b); 2.14(a); 2.25(a),(b); 2.26(a),(b); 2.44(a),(b),(c); Extra Credit: 2.45(a),(b).
• Homework 2, due in class on Sept. 18
Exercises: 3.1(d),(e),(f),(g); 3.5(a),(b); 3.6, 3.8.
• Homework 3, due in class on Sept. 25
Exercises: 3.10(a); 3.11(a),(b); 3.16(a); 3.17(a); 3.19(a); 3.24(a); 3.25(a); 3.26(a);
Additional Problem: Show that the gate defined by f(x,y,z) = (x+y)(x'+z)(x'+y'+z') is universal. Here x' denotes NOT(x).
• Homework 4, due in class on Oct. 9
exercises: 4.1(d),(e),(f); 4.2(a),(c),(d),(f); 4.4(b),(c).
• Homework 5, due in class on Oct. 21
exercises: 4.9(a),(d)[minimal sums only]; 4.11(a),(b)[minimal sums only]; 4.12 (a),(b)[minimal sums only]; 4.14(b),(c)[minimal sums only]; 4.16; 4.18.
• Homework 6, due in class on Nov. 6
5.2(a),(b); 5.3(b),(d); 5.4; 5.5(a); 5.7, 5.8
For 5.2 see slides from Lecture 2. For Definition of Excess-3 Code See Table 2.8 in the textbook.
• Homework 7, due in class on Nov. 13
5.10(a); 5.12(b); 5.14; 5.15; 5.17; 5.19(b); 5.21(a); 5.24(a),(b); 5.25.
• Homework 8, due in class on Nov. 20
6.2; 6.3; 6.4; 6.5; 6.6
• Homework 9, due in class on Dec. 11
7.1; 7.2; 7.5; 7.7; 7.9