Assignments:

Assignment 1: Chapter 2: #4, 6, 7, 8, 12, 14, 18 - Due Thursday, 2/3/2011

Assignment 2: Chapter 2: #34, 42, 44 due Thursday, 2/10/2011

Assignment 3: Chapter 3: #2, 4, 6, 8, 10 - Due Thursday, 2/24/2011

Assignment 4: Chapter 3: #13 (parts b & c, solve with algebra, then Karnaugh Map), 14, 19, 22 (for part c use k-map) - Due Thursday, 3/3/2011

Assignment 5: Chapter 3: #25, 26, 28, 30, and the following: - Due Monday, 3/28/2011

   Simplify the following Boolean functions using K-maps: 
   a) F(x,y,z)=∑(0,2,4,5) 
   b) F(w,x,y,z)=∑(0,2,8,9,10,11,14,15)
   c) F(A,B,C,D)=∑(2,3,4,5,6,7,11,14,15)  

Assignment 6: (Click here) Due: Monday, April 4, 2011

Assignment 7: pg 237: # 2, 4, 5, 8 Due: Mon, 4/25/2011

Assignment 8: pg 240 #16, 20 (and call it twice with different parameters) Due: Mon, 5/2/2011

NOTE: You may find it useful (and fun) to run your program in the Marie Simulator. Type mariesim on the Linux machines, or download a version for PCs or Macs from the Lectures page on this site. —-

Exams:

Exam 1: Monday, February 21, 2011

• You may bring in one sheet of notes (8.5“x11”)
• Covers chapter 2

Exam 2: Thursday, April 21, 2011

• You may bring in one sheet of notes (8.5“x11”)
• Covers chapter 3, including boolean algebraic simplification, Karnaugh maps, and the design and analysis of combinational and sequential circuits.

Final Exam: Monday, May 16, 5:00-7:00 PM