[Skip to Body]
Primary:
[Front Door]
[Current]
[Glance]
-
[Honesty]
[Links]
[Syllabus]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Outlines]
[Readings]
[Reference]
Misc:
[SamR]
[Java 1.4.2 API]
[EIJ]
[CS152 2000F]
[CS153 2004S]
Due: Monday, 1 November 2004
You've dealt significantly with Scheme like lists, which one might describe as iterable collections that preserve order of elements and that you can extend at the front. However, many of the lists that people make have other capabilities and fewer limitations. For example, it is often useful to delete items from a list or to insert at places other than the front. We might describe such lists as iterable collections that preserve the order of elements.
What methods would you have such lists include? Express those methods as a Java interface.
[Skip to Body]
Primary:
[Front Door]
[Current]
[Glance]
-
[Honesty]
[Links]
[Syllabus]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Outlines]
[Readings]
[Reference]
Misc:
[SamR]
[Java 1.4.2 API]
[EIJ]
[CS152 2000F]
[CS153 2004S]
Disclaimer:
I usually create these pages on the fly
, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Wed Dec 8 10:36:56 2004.
The source to the document was last modified on Fri Oct 29 07:16:37 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2004F/Homework/34.html
.
You may wish to
validate this document's HTML
;
;
Check with Bobby