Fundamentals of Computer Science II (CSC-152 2000F)


Homework 3: Array-based Lists

Summary: For this assignment, you will ground your understanding of lists in Java by implementing our list interfaces with a dynamic array.

Group work: I encourage you to work in groups of two or three.

Turning it in: Deposit your files in the course dropbox at http://blackboard.grinnell.edu.

Assignment

Implement the List.java and ListIterator.java interfaces using a resizable array in which the first element of the list is not necessarily the first element of the array. Each add method should be O(1) (except when you are forced to resize the array) and each delete method (except deleteValue) should also be O(1). The list should never fill (unless we run out of memory).

Extra Credit

Add other cool features.

Notes

History

Friday, 10 November 2000

Monday, 13 November 2000


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2000F/Homeworks/hw.04.html

Source text last modified Mon Nov 13 08:19:21 2000.

This page generated on Mon Nov 13 08:20:02 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu