CMPS 13H: Honors Introduction to Programming and Data Structures
Programming Assignments
There will be several programming assignments, each due about a week after
it is assigned. Due dates are listed with the information about that assignment.
All programming assignments are due at midnight on the date specified. Late assignments
will not be accepted unless they are the result of an emergency or severe illness,
and then only by permission of the instructor. Be forewarned, if you claim to
have had an emergency or severe illness, I will require a note from your doctor.
One word of advice; these assignments may be difficult so it is essential that
you start them early and give yourself enough time to work on them.
Turning in programming assignments
Programming assignments are to be turned in electronically, using submit.
The class locker is cmps013h-sb.w04 and the assignment name is simply assignmentn,
where n is the number of the assignment, i.e. assignment #1 is assignment1.
For example, to submit assignment #1, assuming that you want to submit
a file called foo, simply type:
submit cmps013h-sb.w04 assignment1 foo
To submit multiple files, simply execute this command multiple times,
specifying the correct file name each time (or a list of files
separated by spaces). Alternatively, you can tar your files into
single file and submit that. For more information on the tar command,
type "man tar".
For more information about how to use submit, just type "submit
-m" on one of the cats machines and you will get the instructions.
Tools and Techniques
Good programming involves more than just good coding. This link will point you
to some additional programming resources and instructions about getting started
with Java and Unix.
Tools and Techniques for CMPS 13H - you must read
this and use the tools and techniques listed
Each program must be accompanied by a one page ASCII document (.txt format),
called Design.txt, that shows your design. It should include
- Inputs
- Input names
- Input types
- Use - what information they store
- Outputs
- Output names (if named - the return value is not named)
- Output types
- Use - what information is outputted
- Data objects and all non-trivial operations on those data objects
- Names
- Types
- Use - what information they store
- Algorithm(s)
- Describe all non-trivial operations in the program. Give a high-level
algorithm and then give a more detailed algorithm for each of the non-trivial
steps in the higher-level algorithm. Each algorithm should have 4 to 6
steps.
The Assignments
Assignment
|
Description:
|
Solution
|
|
Temperature Conversion
|
|
|
Tic-Tac-Toe
|
|
|
Polynomials
|
|
|
Sets
|
|
|
Polynomials II
|
|
|
Word Count
|
|
Assignment 7 |
TBD
|
|
Assignment 8 |
TBD
|
|