Week 08 Notes for CS 2500, Section 002 -- Spring 2001

• Look at Upcoming Schedule
• Class starts at 09:40. I take roll at 09:50
• Announcement(s)
• Discuss the problem of finding a match for a client. (use tryMatch.pcode)
• Continue discussing linked lists.
  • The interface to our linked list is the same as the interface to our array list. This is a case where the ADT remains the same. It is only the implementation that differs.
  • Note what is different in ListP.h from ListA.h
  • In the ListP.cpp implementation file we see the use of pointers, linking, dynamic memory allocation/deallocation using the "new dataType"/"delete pointerToData" functions/syntax.
  • Look at various samples of insertion code. Get help from example *.jpg files.
  • Look at a couple of cases of retrieval.
  • Consider deletion
  • Review the pro's/con's and performance differences between pointer-based and array-based implementations.

• Look at Upcoming Schedule
• Class starts at 09:40. I take roll at 09:50
• Announcement(s)
• finish up discussing linked lists
  • the destructor: ~listClass
  • ListRetrieve
  • the copy constructor: listClass(const listClass&)
    • what does it do?
    • how do you call it?
  • Review the pro's/con's and performance differences between pointer-based and array-based implementations.
• If time allows, begin discussing applications of the stack data type
  • Evaluating postfix expressions
  • "Towers of Hanoi" puzzle program
  • depth-first search