Overview
This chapter is a coding challenge. All pages in this chapter relate to the coding challenge.
We will be coding a DynamicArray (as described in the previous chapter).
Another way to look at this challenge is to take a fixed array and code in the dynamics (i.e., code to support adding, inserting, and removing of elements).
Objectives
- Code a dynamic array that solves the big limitation of a fixed array (its size is "fixed")
- Gain experience using an ADT (Java Interface)
- Gain experience using an Java generics (which can be tricky, but we'll get them)
- Code unit tests (like we've done previously) to assure software quality
- Solve a complex problem by designing and scratching out algorithms
Scoring (Grading)
- The grader will score by performing a general unit test pattern
- The grader's test scenarios will cover all or most of the required program code (this largely consists of required constructors, plus required instance methods (per ADT)
- Be very careful to avoid blocker bugs -- they can turn awesome code into non-runnable zero-scoring code