CS 239 - Data Storage and Data Structures, continued

• Not simply throwing the exceptions - no need to catch and rethrow...just throw and let the caller handle.
• Not building the ArrayList in the constructor to insure that we had all of the reserved slots (we are simulating a static structure with a dynamic one)

Review

As we begin to program larger applications, the decision about choosing the right "tool for the job" becomes more important.

Programs may manipulate large quantities of data.

Choosing a data structure that fits the needs of the problem at hand can make programming easier and make processing more efficient.

Data Structure - A mechanism for organizing related pieces of information.

Categorizing Structures in Memory

homogeneous structures - the contents of the structure will be the same (arrays, ArrayList<type>)
heterogeneous structures - the contents of the structure may differ (records, objects)

We can discuss a queue. (Think line at the grocery store).

What do we know about queues?

Does this conceptual view of a queue differ based on its implementation?

Again thinking of a queue...what are some operations that we might perform on a queue?

Do these conceptual operations depend on the underlying implementation?

Some conceptual structures and their "behaviors" and terms

Behaviors:

Terms:

ArrayList
List

Behaviors:

Terms:

Queue

Behaviors:

Terms:

Stack

Behaviors:

Terms:

Behaviors:

Terms:

Implementation of data structures - Arrays and Linked Lists

Queue.java (array) Queue.java (list)

Stack.java(array) Stack.java(list) Tester.java(list)