| CIS 210 Home Page | Last updated 2007/11/04 11:14:58 |
This is a makeup assignment that you may choose to do in order to boost your total assignment score for the class. It is entirely optional. If you choose to do this assignment, your score on it will be added to your total assignment score (but your total cannot exceed a perfect score on all eight regular assignments). So the problems on this assignment could either make up for an assignment that you never turned in, or boost your total for assignments on which you did not do as well as you wanted.
You may not work as pairs for this assignment - all work must be individual.
If you choose to do this homework, it is due at 5 PM on Friday, November 30. Use the web service e-turnin to submit your work electronically. You may turn in revisions of this homework up to the time it is due.
Problem 9.1 - Translate phone number mnemonics to digits | |
| Time Estimate | 2 hours |
| Topics | Strings and Arrays |
| Turn in | CodeToPhone.java |
| Points | 40 |
The full description of this problem can be found at problem description for 9.1.
Problem 9.2 - Arithmetic with Binary Numbers | |
| Time Estimate | 3 hours |
| Topics | Booleans, Arrays, binary arithmetic |
| Turn in | BinaryNumber.java |
| Points | 40 |
The full description of this problem can be found at problem description for 9.2.
Problem 9.3 - Generate mnemonics for phone numbers | |
| Time Estimate | 3 hours |
| Topics | Recursion, Strings, Arrays |
| Turn in | PhoneToCode.java |
| Points | 40 |
The full description of this problem can be found at problem description for 9.3.