CS 112b
Spring 2004
Ileana Streinu

• Memory leaks and dangling pointers.
• Destructors, and what they do.
• Using lists to implement other data structures (stack, queues). Example for the Stack. Discussion.
• Independent work on formal lab 19. Start working on it, work on understanding it and get as far as you can during the lab. The next homework is similar, but for queues and for another application.
• Discussion of next homework Hw 9.