CS 150 Homework

(Assignments not marked “assigned” may change slightly.

I may add one written assignment at the end as well)

Assignment #1 (Due Thursday Jan 17th, in class)

· Assigned Jan 10^th

· Chapter 1, all ODD problems

Assignment #2 (Due Thursday Jan 24^th, in class)

· Assigned Jan 17^th

· Chapter 2, all ODD problems

Assignment #3 (Due Tue Feb 5^th, in class)

· Assigned Jan 29th

· Chapter 3, problems # 2, 6, 10, 12, 14, 16, 22, 30, 44 -- all 10 points each

Assignment #4 (Due Thu Feb 15^th in class)

- Just do problem 11 from the sample midterm (the one posted on the class website -- http://www2.cs.uidaho.edu/~cs150) , this includes not only the state machine diagram but the "bonus points" question where you build the truth tables

Assignment #5 (Due Thu Feb 28^th in class)

· Chapter 5, problems #4, 8, 12, 16, 20, 24, 28, 32, 36, 40 - 10 points each

Assignment #6 == Program #1 (Due Tue March 5^th via EMAIL by end of day)

· Write the program specified here: (passign1s08.pdf)

Assignment #7 (Due Tue March 18^th)

· Chapter 6, Problems: 6.4, 6.9, 6.17, 6.18

· Chapter 7, Problems: 7.1, 7.5, 7.9, 7.10, 7.19, 7.24,

Assignment #8 == Program #2 (Due Th March 20^th via EMAIL by end of day))

· Write the program specified here: (passign2s08.pdf)

Assignment #9 (Due Th April 3^rd)

· Chapter 8, #1, 2, 3, 5, 6, 7, 11, 14, 15, 16

Assignment #10 == Program 3 (Due Mon April 7^th via EMAIL by end of day)

· Write the program specified here: (passign3s08.pdf)

Assignment #11 – handed out in class (worth 100 pts)

Assignment 12 – Final Assignment – Due finals week (worth 100 pts)

· Take the following code: (asm version) generated from the following (c code), except I removed the “convert routine” part

· Insert the Convert routine into the proper place (get my copy of convert routine)

1. You should handle the stack correctly for getting the input values

2. You should handle the stack correctly for returning the result