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: [[Assignment 6 Link|(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. /* Assignment 3: Chapter 3:: #2, 4, 6, 8, 10, 13 (b & c), 14, 19, 22 (for part c use k-map), 25, 26, 28, 30, 39, (and create Moore state diagram), 40, 41, BCD counter Assignment 5: [[Assignment 5 Link|Assignment 5 Link]] due: Mon, 3/29/2010 Assignment 6: [[Assignment 6 Link|Assignment 6 Link]] due: Wed, 3/31/2010 Assignment 7: pg 237: # 2, 4, 5, 8 due: Wed, 4/7/2010 Assignment 8: pg 239: # 12, 13, 15, 16 (run the program on the Marie simulator) due: Wed, 4/21/2010 Assignment 9: pg 275: # 2, 8, 9, 12, 14, 15, 16, and the following two questions: (1) An 8 bit register A contains 0101 1010. Assume the bits are ordered 7 - 0 from high order bit to low order. How would you change bits 3 and 2 to 01 using Boolean Logic statements? (2) An 8 bit register A contains 1100 1101. Starting from the original value in each case, show the result of a logical shift right, a logical shift left, an arithmetic shift right and an arithmetic shift left. */ ----

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 /* - Tuesday, May 18, 9:00-11:00 AM * You may bring in one sheet of notes (8.5"x11") * Covers the chapters 4 and 5, and the logical and bit manipulation statements as covered in class. */