Tentative schedule, CS 46B, Spring 2003



Assignment 1, due Wednesday, February 5   
Assignment 2, due Wednesday, February 19
Test 1,       Wednesday, February 26         
Assignment 3. due Wednesday, March 5   
Assignment 4, due Wednesday, March 19   
Test 2        Wednesday, April 9 !!!!!!!!!!  A CHANGE !!!!!!!!!!!!
  this test will cover Chapters 1-7 except for
    the section in Chapter 7 on priority queues,
    and the topics of doubly linked lists & header nodes from Chapter 4
  emphasis will be on the material since the last test
Assignment 5, due Monday, April 14   
Assignment 6, due Monday, April 28
Test 3        Monday, May 5 
Assignment 7, due Monday, May 12

Spring break/Cesar Chavez day
    March 24-31

Final Exam: 
    Friday, May 16, 1215-1430, in the regular classroom

Coverage of Final Exam:
  Chapters 1-7, except for priority queues (from Chapter 7)
  Chapters 9 and 11 -- except for Java's HashTable class 
               (you should understand the HashSet & HashMap classes, though)
  Sections 10.4 & 12.1
  From Chapter 8, you should understand 
    what recursion is, 
    the use of stacks to implement recursion
    the divide-and-conquer algorithm design technique
    and you should understand the recursive examples of Chapter 9

Specific examples such as the animal guessing program of Chapter 9 and the mazes
and fractals of Chapter 8 will not be covered explicitly, although understanding
them will help you understand the material of the corresponding chapter.  The
various bag examples did introduce a number of topics that we covered in class and
that you are responsible for