As part of your review
process, I recommend you study:
- Notes from class and slides
- Reread book chapters
- Programming assignments
- Look over exercises at the end of the chapter in the book.
Chapter Four -- Linked Lists
1. Know the terminology, concepts, and programming
syntax connected with pointer-based lists: pointers, dynamic allocation
of memory, using new, using delete,
referencing pointers
(ptr->Item), sequential search, traversal, and so forth.
2. Understand how to declare the C++ data types that
are necessary for setting up a linked list -- for example:
struct node ;
typedef node * ptrType ;
struct node
{
int Item ;
ptrType Next ;
} ;
3. Be able to explain how nodes containing items are
linked together to form linked lists.
4. Understand how an element is located in a linked
list by doing a sequential search. Understand the use of prev and cur
pointers in such a search.
5. Know how elements are inserted into a linked list
and how they are deleted from a linked list.
6. Understand the need for a special copy
constructor and a special destructor when programming a linked list
class that uses dynamic memory allocation.
7. Know the relative advantages and disadvantages of
array-based lists versus pointer-based lists.