The first lecture describes how to create a stack.

The second lecture describes how stacks are used to implement function callls, and parenthesis matching. The slide set is the combined for the two.

The third lecture shows how stacks can be implemented using linked lists.

The tutorial contains questions on implementation and use of stacks.

In this lab you will be working on circular and double linked lists. You will demonstrate the operations on simple linked lists.

This is the backlog you will be working from this week. It uses material covered in prevous classes. You will be demoing material from the Arrays Backlog this week and next. Download the project with wget ds.nathanielgmartin.com/LinkedList.zip.

This is the backlog for the material covered in lecture this week. You will not be demoning the material in this backlog until Week 9, but it is a good idea to look over the backlog and to download the project files using wget ds.nathanielgmartin.com/Stack.zip.