Date: 5 December 2005

Author: Sue Evans, bogar@cs.umbc.edu

The following is a CLARIFICATION about project 5:

• The reason I asked for 3 linked lists is because the problem is too easy to solve using only one list and I wanted everyone to write the code that will delete a node from one list and insert it into another one. This is a minimum amount of work to do to give you some real experience using linked lists.

  So you must write your code so that when a student misses a question, that question gets deleted from the original list and gets inserted into the once-missed list.

  Then the once-missed questions should be presented to the student and if the student misses a question, it should be deleted from this list and inserted into the always-missed list.