The exercises will help
you to master the basic concepts for the given week. Each assignment consists of an
etude and the main part.
Work out the etudes on your own before you meet with
your partner. When you meet, compare your solutions and discuss any problems you encountered. If you are
unable to complete the etudes by Thursday, ask questions in class, or see someone during their office hours.
Etudes are designed to give you a practice with the basic skills you need to understand for each week.
Keep your solutions in your portfolio, but do not hand them in. We will check them
when we check your portfolio.
Work on the main part of the assignment with your partner. Hand in
one joint program.
DUE DATES:
Homework assignments must be submitted by 9:40 am on Tuesday unless otherwise specified.
Turn in each assignment with a Java comment on the top of the assignment that specifies
the following pieces of information:
- Assignment: (number)
- Lab TA:
- Name:
- ID: (last 4 digits only)
- Name:
- ID:
Omission of this information leads to immediate loss of all credit for the homework.
| Week | Assignments | Due Date |
|---|
|
Review HtDP: Accumulator style programs.
| 1/16 |
|
Review HtDP: data definitions and class diagrams to represent classes; containment, union.
| 1/23 |
|
Designing classes for self-referential and mutually referential data, Methods for simple classes including composition and conditional; Methods for containment.
| 1/30 |
|
Methods for self-referential and mutually referential data; Using libraries: The World teachpack.
| 2/6 |
|
Abstracting classes: lifting fields, lifting methods, creating a super class, a union.
| 2/13 |
|
Deriving classes; Data integrity; Equality.
| 2/20 |
|
Eclipse IDE; Encapsulation.
| 2/27 |
|
Equality; Singleton pattern; Function objects; Inner classes.
| 3/13 |
|
Designing generic algorithms; Testing the effects; Imperative World.
| 3/20 |
|
Algorithms for direct access data: ArrayList.
| 3/27 |
|
Implementing ADTs; Algorithms that used index-based data access; Stress tests: Sorting out Sorting.
| 4/3 |
|
Maps, hash tables, trees, priority queues; JUnit.
| 4/10 |
|
Project: Graph traversals: DFS, BFS, shortest path, minimum spanning tree -- optimizing the performance, designing reusable code.
| 4/18 |
|
Portfolio Review.
| END |