Computer Science 101
                               Quiz 6      Name ______________________

1. Consider the problem of computing the Fibonacci recurrence discussed
   in class last time.  Identify the correct way to perform the basic
   update

   a. new = old + older;             b. old = new;
      old = new;                        older = old;
      older = old;                      new = older + old;

   c. new = older + old;             d. All are correct
      older = old;
      old = new;


2. Consider the problem of finding the maximum value in an input file.
   Suppose the value maxval is used to hold the maximum. At the start
   of the program maxval should be initialized to:

   a. 0                              b. 10000000

   c. -9999999                       d. the first value in the file


3. Consider the problem of determining whether or not a program contains
   the number 13.  The "yes" or "no" should be printed

   a. Within the while loop in       b. After the while loop
      which values are read

   c. Both places


4. This program is intended to print the number of 3's in a file

   int main()
   {
      int counter;    // the number of three's we've seen
      int value;      // the value just read
      int howmany;    // howmany values were read

      howmany = fscanf(stdin, "%d", &value);

      while (howmany == 1)
      {
         if (value = 3)
            counter = counter + 1;

         howmany = fscanf(stdin, "%d", &value);
      }
      fprintf(stdout, "The number of 3's was %d \n", counter);
      return(0);
   }

   It has two fatal errors in it.  Identify them:

   a -


   b -