COSC 350: Data Structures
Feb. 25, 2009

Linked Lists Concluded

Review of Linked Lists implemented with arrays

Memory Management with Lists

Dynamic allocation: new and delete
Free-list
Garbage Collection: Stop & copy, Mark & sweep, etc.

Strings as Arrays with Null Termination

Operations
Issues

Compound Data Structures

Homework

Friday: Reimplement the linked-list class presented in class:

1. using dummy head and tail nodes
2. as a double-linked list

(Friday's assignment counts as two assignments.)

This page was created by Joe Sloan.
It was last modified on or after: 4 March2009
Send mail to: sloanjd@wofford.edu