Practice Problems: These exercises
will help you to master the basic concepts covered in
the lectures/labs.
Complete them on your own before you meet with your
partner. When you meet, compare your solutions and
discuss them and ask questions in lecture or during
the lab.
These will not be graded, but save your solutions in
an electronic portfolio so we can complete a
simple code review at some point during the semester.
Pair-Programming Problems: To be
completed with your partner. A single solution will
be submitted per pair. Initially programs will
consist of a single Java file, but may later be
broken into multiple files. The submission process
will be explained in lecture.
| Num | Topic | Out | Due |
|---|
| 01 | Racket review, accumulator style programs | 9/8 | 9/15 | | 02 | Java, classes, unions, recursive data | 9/15 | 9/22 | | 03 | Methods for classes, recursion | 9/22 | 9/29 | | 04 | Worlds, Images, Games | 9/29 | 10/13 | | 05 | Functional classes, Parameterization, Mutation | 10/13 | 10/20 | | 06 | Mutation, ArrayList, Functional Classes Cont. | 10/20 | 10/27 | | 07 | Mutation, Loops, ArrayLists, Sorting | 10/27 | 11/10 | | 08 | HashMap, State | 11/10 | 11/20 | | 09 | Structures, Algorithmic Complexity | 11/17 | 12/5 | | FP | Final Project | 11/14 | 12/9 |
Optional Assignments| Num | Topic | Out | Due |
|---|
| E2 | Exam 2 Extra Credit | 11/7 | 11/17 |
|