CS 207 Assignments

• Assigned 9/13/99, due 9/15/99. Meeting the PDP8/E
  
  
• Assigned 9/15/99, due noon Thursday 9/23/99. Write a multiplication subroutine for the PDP8. When the subroutine is called via a JMS call, memory locations 0176 and 0177 should contain the 12-bit two's complement factors to be multiplied, and the AC should contain the address of the first of two consecutive memory locations where the 24-bit product will be stored (first the high-order word, and then the low). Your multiplication routine should take both overflow and sign into account.
  
  
• Due midnight, Monday 9/27/99. Write a function for the PDP8 that uses recursion to compute the Nth triangular number. Your main program will get N from the switch register and call a recursive function with N as its parameter. The recursive function, upon return to the main program, will have left the Nth triangular number (T(N) = 1 + 2 + ... + N) in the AC. Don't start this until we talk about it in class.
  
  
• Assigned 9/20/99, due Wednesday 9/29/99. Write a PDP8 program that clears as much memory as possible, using no more than 100 (base ten) lines of code. If your program clears all memory, including the program itself, you will earn an A+. Clearing all but one location is worth an A, all but two is worth an A-, etc. Note, by the way, that if you clear all memory, your program will not halt by itself. (What will it do?)
  
  
• Assigned 9/29/99, due at class time, Wednesday 10/6/99. Do problems 1-8, 10, 13, 18-24, and 44 from Chapter 2, and problems 9, 10, 12, 13, 17, and 29 from Chapter 3. Hand in on paper.
  
  
• Assigned 10/11/99, due on paper at class time on 10/15/99. Do problems 3, 6, 7, 15-18, and 23 from Appendix B of Patterson and Hennessy.

  Also, design and draw a 1-bit 4-function ALU with the following specifications. The unit should have five input lines: (1) A, a data line, (2) B, another data line, (3) Cin, the carry-in for addition, and (4-5) S0 and S1, a pair of control lines that determine the operation performed by the ALU. There should be two output lines--the result R, and the carry-out Cout. R should depend on the input as follows:

         S1 S0           R
         ============================
         0  0            A
         0  1            A + B + Cin
         1  0            A OR B
         1  1            NOT A      
  

  Cout should be the carry-out if the operation is addition (that is, S1 = 0 and S0 = 1), and 0 otherwise. Note that R is a single bit, so the result R of the addition operation is the right-most bit of the sum of A, B, and Cin.
  
  
• Suggested 11/1/99, due never. Problems 1-6, 14, 15, 25-28 from chapter 4, problems 5-7, 14, 15, 17 from chapter 5, and problems 1-4, 9-13 from chapter 6.
  
  

Suggested Reading

• 9/13/99 Read Chapter 1 of Patterson and Hennessy.
• 9/27/99 Read Chapter 2 of P and H.
• 9/29/99 Read Chapter 3 of P and H.
• 10/11/99 Read Appendix B and Appendix sections A.1-4 of P and H.
• 10/XX/99 Read Chapters 4 and 5.
• 11/1/99 Read Sections 6.1-6, 6.10, and 6.11 (feel free to read the rest of Chapter 6 if you wish).