Name: _______________________

Honor Code Acknowledgment: ______________________

                   Random Quiz # 15 
                 CPS 08, Spring 1995
                   April 21, 1995

Problem 1: BooBerry (3 points)

Fill in the body of the function NodeCount that counts the number
of nodes in a linked list

    struct Node{
        String info;
        Node * next;
    };
    int NodeCount(Node * list)
    // precondition: list is 0-terminated (last node's next field == 0)
    // postcondition: return number of nodes in linked-list 
    //                pointed to be list
    {








    }


problem 2: Tail of Vienna Sausage (3 points)

Write the function  LastNode whose header is
given below.   LastNode returns a pointer to the last
node of list.

      Node * LastNode(Node * list)
      // postcondition: returns pointer to last node in list
      //                returns 0 if list is 0