CSC 270 Computer Organization

Weber/Fall, 2012

Syllabus

Announcements

Assignments

Examples

Resources

Announcements

Old announcements

Assignments

A8: Due 12/7
Turn in answers to exercises 8b, 15eg, 17eg, 18a, 19bc, 21c, and 22c from chapter 10 (pages 541-544).
A7: Due 11/30
Translate both the iterative and recursive versions of the decimal-to-binary C++ programs to Pep/8.  Send me the assembly code versions of both programs.
A6: Due 11/5
Do problem 15 on p. 187.  Make sure your Pep/8 "object" code really works in Pep/8, then email me the code, either in the message body or as an attachment.
A5: Due 10/24
Turn in answers to exercises 23, 25, 29a, 31b, 32b, 35, 37, 41, 45, 47, 49, 52b-f, 53b-f, and 55abcf from chapter 3 (pages 142-146).
A4: Due 10/17
Modify the example C++ program from Friday, Oct. 12, to calculate the square root of a number using a recursive implementation of the Newton-Raphson method.  Hint: the new recursive function will need two parameters: v, the value to take the square root of, and xold, the most recent approximation to the answer.
A3: Due 10/10
Turn in answers to exercises 2b, 4df, 6be, 7ce, 9, 16abc, 18bcf, and 20abd from chapter 3 (pages 139-142).
A2: Due 9/19
Turn in answers to exercises 2bce, 3bce, 5abc and 7ab from chapter 2 (pages 81-2).
A1: Due 9/10
Write a C++ function that will two parameters—an array of unsigned int and the size of the array—and return the median value in the list.  Also write a C++ program to test your function.  Hand in the function and the test program by email to weberk@mountunion.edu

Examples

Resources