|CSC 161||Grinnell College||Spring, 2010|
|Imperative Problem Solving and Data Structures|
This laboratory helps you gain more experience with the use of lists and pointers.
This lab involves working with lists of data, using an existing driver program which actually constructs the lists. In particular, file ~walker/c/lists/namelist.c contains a menu-driven program to maintain a list of names.
As written, the program contains functions to insert a name on the list (before a designated node), to delete a specified name from the list, and to print the names on the list.
As you may have discovered, in addition to the above features, program namelist.c contains several stubs for additional functions, but details of these functions are not given. Your task in this lab is to fill in the pieces for two of these new functions on the menu.
To perform this task, you have to move along the list item-by-item until coming to the end, where the next field is NULL .
To perform this task, you will want to move along the list item-by-item, counting the items as you go.
This document is available on the World Wide Web as
created 27 September 2001
last revised 4 April 2010
|For more information, please contact Henry M. Walker at email@example.com.|