[ 10.html ]
and do Review Questions.
[ list1.cpp ]
is the example at the start of the chapter written using the STandard Library <list>.
[ list.pdf ]
is the UML picture of pages 477 to 478.
[ Linked_list ]
[ Stack_(data_structure) ]
[ Queue_(data_structure) ]
Hand in one even question+answer at the start of class.
Perfect projects can earn a 5 point bonus if handed in at the start
of this class.
[ 11q.html ]
[ 13frame.html ]
[ LinkedQueue.cpp ]
[ LinkedQueue.h ]
[ testLinkedQueue.cpp ]
[ 12.html ]
I had some real problems with the above program because I
forgot that when you move or erase an item in the list
other iterators that point to the moved or erased node
become invalid. They stay attached to the old position
in RAM, after the node has moved...
Similarly inserting an item before the first item does
not update iterators... I had a begin iterator that ended
up attached to the 4th item, not the 1st!
Next project due next class.
Chapter 10,11,12, algorithms, and P2 in next class.
Arrays, vectors, lists, stacks, and queues are all
in the Standard Library(STL). It has other Containers as well: sets, maps, priority_queues,
and so on. We will study these ate the end of the course using Chapter 13 and the first part of chpter 20.
You can use my notes
[ stl.html ]
if you wish. Some of these are mentioned in laboratories, exercises, but not in quizzes.
They are covered in detail in CSE330 Data Structures.