Assignments:

Assignment 1: pg 94: #2 (a,b), #4 (a,b) #5 (c,d), 6, 7, 8 - Due Wed, 2/3/2010

Assignment 1: (added) pg 97 #24 - also due Wed, 2/3/2010

Assignment 2: pg 98: #30, 34, 42, 44 due Wed, 2/10/2010

Assignment 3: pg 155: # 2, 4, 6 due Wed, 2/17/2010

Assignment 3: (added) pg 156: #8, 10, 13 (b & c), 19 due Wed, 2/17/2010

Assignment 4: Assignment 4 Link due Wed, 2/24/2010

Assignment 5: Assignment 5 Link due: Mon, 3/29/2010

Assignment 6: 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: March 3, 2010

• You may bring in one sheet of notes (8.5“x11”)
• Covers chapters 2 and 3 plus designing and analyzing combinational circuits

Exam 2: April 14, 2010

• You may bring in one sheet of notes (8.5“x11”)
• Covers the design and analysis of combinational and sequential circuits

Final Exam: - 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.