CSC195, Class 39: Implementing List Operations

Overview:
* Discussion: Lists with current
* A list struct
* Implementing 
  + new
  + add
  + advance
  + deleteCurrent
  + clear

Notes:
* New homework assigned: To-do list.
* Read Gries 11.
* Class Friday in Saints' Rest.  Please try to arrive early so that
  you've ordered your coffee before class starts.
* Did anyone attend last night's talk?  What did you think?
* Cool summer opportunities in Math at Iowa State, some of 
  which are related to CS.  I have handouts for those
  interested.
* Extra credit for attending Friday's noontime talk on 
  Mathematics education.
* What to take in the fall.

MAT218 ???
CSC223 Bishop
CSC211 (Architecture) in the fall
CSC261 AI (Stone)
CSC301 Gum
Two credit: "Learn to program for Sam's research"

* What to take in the spring

CSC362 (Compilers) Rebelsky
CSC302 Walker
CSC341 Gum
CSC397/Cryptology Bishop
Two credit: "Learn to program for Sam's research"

CSC152 Gum
CSC153 Sam

TEC154 Sam

Back to lists
-------------

Goal: Implement
  + new
  + add
  + advance
  + deleteCurrent
  + clear

* returns node for the head ; PARAMS are ...
  + If you just return a node, you can't access the length
* returns int for success/failure ; PARAMS are list lst
* return a pointer to a new list (or null for failure);
   no parameters

list newList() {
  list tmp = malloc(sizeof(*list));
} /* newList() */