CS-341 Assignments, Spring 1997
Note: Homework assignments for this course are graded, which
means that you must hand in your own work. It's all right to talk with
others about the assignments, but you must do the exercises yourself.
The rule to follow is that there must be no exchange of written
(electronic or otherwise) solutions between people. Failure to abide by
this policy will result in failure in the course!
Homework assignments are due on the date indicated, but will be accepted
for "late" credit until the next class after the due date. I use the
following grades for homework:
Good 4 points
OK 3 points (full credit)
Not OK 2 points
Late Subtract 1 point from above
At the end of the term, I will sum all your homework grades and compute
an average that will count approximately 10% of your course average.
Assignments
- 1. February 7
- Exercises 2.14, 2.15, 2.16, 2.17, 2.18, 2.19.
- 2. February 11
- Exercises 3.19 and 3.20. Extra: 3.21.
- 3. February 21
- Translate the instruction "
beq
3,4,somewhere" to hexadecimal. Assume the instruction is at
decimal address 1020 and that the label "somewhere"
represents decimal address 996.
- 4. February 28
- Read Sections 1 through 3 of Appendix B and do
Exercises B1, B2, B3, B4, B5, B6, B10, B11, B12.
- 5. March 25
- Do Exercise 4.1. Translate 1.23 into a
single-precision IEEE-794 floating-point number.
- 6. March 28
- Implement a ~S ~R latch using four NAND
gates. Draw a "truth table" to describe its operation, and draw a
timing diagram to illustrate its behavior.
- 7. April 11
- Complete the design of a 32M x 12 memory system
using 8M x 4 SRAM ICs that was begun in class on April 8.
- 8. May 2
- Complete the table showing the settings of
various control signals for different instructions that was begun in
class on April 29.
Dr. Christopher Vickery
Computer Science Department
Queens College of CUNY