(Latest Revision: 10/19/2000)
Week 07 Notes for CS 2500 -- Fall 2000
Monday, October 16
- Take Roll.
- Announcement(s)
- Sorry, no progress yet on grading program #2
- We have a program #3 assignment now -- the
"Grocery Checkout Problem."
- We have to pick up our pace just a little
now. We need to do programs 3-5 by the end
of the semester.
- I will be posting the program #4 assignment
soon.
- Discuss program #3
- Continue discussing the example data structure: a
version of the listClass (an array-of-structs
implementation).
- Begin discussing linked lists.
Wednesday, October 18
- Take Roll.
- Announcement(s)
- Sorry, no progress yet on grading program #2
- Discuss shar'ing files
- Discuss "make" a little?
- Discuss program #3 level two design
Friday, October 20
- Take Roll.
- Announcement(s)
- Sorry, no progress yet on grading program #2
- Finish discussing program #3 level two design
- Begin 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.