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

[Current] [News] [Glance] [Search] [Instructions] [Links] [Handouts] [Project] [Outlines] [Labs] [Homeworks] [Quizzes] [Exams] [Examples] [EIJ] [API]

Class 41: Linked Lists, Concluded

Back to Recover from Election. On to Introduction to Linear Structures.

Held Friday, November 10, 2000

Summary

Today we continue our investigation of linked lists.

Notes

For Monday, read the chapter in Bailey on linear structures.
Hw 4 is finally ready.
Useful files
- List.java
- ListIterator.java

Overview

Review: Linked lists
Writing methods
Iterators
Variations

Methods, Continued

We've done addToFront.
How about deleteFirst?
How about addToEnd?
How about deleteLast?

Iterators

What will our iterators look like? Each will probably contain a reference to the ``current'' node.
...

Variations

Doubly-linked lists: Include a link to the previous element
Circularly-linked lists: Include a link from the last element to the first.
...

History

Wednesday, 23 August 2000

Created as a blank outline.

Thursday, 24 August 2000

Slight reorganization to page design.

Friday, 10 November 2000

Filled in details, based primarily on previous outlines.

Back to Recover from Election. On to Introduction to Linear Structures.

[Current] [News] [Glance] [Search] [Instructions] [Links] [Handouts] [Project] [Outlines] [Labs] [Homeworks] [Quizzes] [Exams] [Examples] [EIJ] [API]

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/Outlines/outline.41.html

Source text last modified Fri Nov 10 08:31:00 2000.

This page generated on Fri Nov 10 08:59:46 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu