I will make additions and changes to this schedule as the semester progresses.
Keep checking the class web space to see the latest version.
 
(Are you looking at a stale web page? 
Try refreshing your browser.)
 
(rev. 05/20/2010)
[05/20/2010: inserted coverage on Final]
 
[05/20/2010: inserted coverage on Quiz #3]
 
[05/11/2010: Modified due dates for Asg 05]
 
[04/26/2010: Inserted due dates for Asg 04 and Asg 05]
 
[04/23/2010: Moved back date for quiz #2]
 
[05/01/2010: Inserted due date for Asg 02]
 
[03/17/2010: Inserted due dates for Asg 03]
 
[03/17/2010: Inserted due dates for Asg 03]
 
[03/17/2010: Inserted due dates for Asg 03]
 
 
WORK SCHEDULE FOR CS 3100 -- Spring 2010
WEEK #1: WF Feb 17 & 19
-  WEEK #1  CS 3100 meets for the first time in N-104 on
     Wednesday, Feb 17.  
 -  Let me know immediately if you need a CS Lab computer account or a new
     password on your existing account. 
 -  Retrieve and study the
       
     Hello World!
     exercise from the class web space.  As an outside-of-class assignment, go
     to the CS lab in
     
     (P-288) 
     this week or early next week and perform the Hello World!
     exercise. This will introduce you to some of the editing, compiling,
     scripting, and e-mail tasks required for completing class programming
     assignments.  Let me know if you have any problems doing the exercise.
     
     
 -  Retrieve and study the program #1 assignment from the class web space.
     Get started on the assignment.  We will discuss it in class very soon.
     
 -  Figure on having to cover an average of about 30 pages per week in
     Carrano.  Continue working on your 'unix proficiency' throughout the
     semester.  
 -  Reading Assignment:  
     
     -  Read the class documents: course description and this schedule
     
 -  If not familiar with C++, read A.12 pp 869-872 and then begin reading the review of C++ on p 807.
     
 -  Review the use of unix computers.  Use your unix book if you have
	  one.  If you don't have one, get one.
     
 -  Carrano: chapter 05 (Recursion as a Problem-Solving Technique) 
     
 
 
 -  Note: There may be confusing
          
           errors in Carrano.   Throughout the
	  semester, while reading be sure to
          
          check the errata sheet
          Carrano has posted. 
 
 WEEK #2:   MWF Feb 22, 24 & 26  
-  Reading Assignment:  
     
     -  Carrano: first half of chapter 09 (Algorithm Efficiency and Sorting)
     
 
 
 
 WEEK #3:  MWF Mar 1, 3 & 5 
-  Reading Assignment:  
     
     -  Carrano: remainder of chapter 09 (Algorithm Efficiency and Sorting)
	  plus beginning of chapter 08 (Advanced C++ Topics)
     
 
 
 -   DUE DATE:  Monday, Mar 1, 2010 --
     program #1 (Expression Catcher) 
 
 WEEK #4:  MWF Mar 8, 10 & 12 
-  Reading Assignment:  
     
     -  Carrano: first two-thirds of chapter 08 (Advanced C++ Topics)
     
 
 
 
 WEEK #5:  MWF Mar 15, 17 & 19 
-  Reading Assignment:  
     
     -  Carrano: finish chapter 8
	  and begin chapter 10 (Trees)
     
 
 
 -    QUIZ #1: Monday, Mar 15, 2010 on:
     
     -  Chapter 5 (Recursion as a Problem-Solving Technique)
     
 -  Chapter 9 (Algorithm Efficiency and Sorting)
     
 
 
     To study for quizzes, participate in class, do the assigned reading
     (including examples and sample code!), do self-test exercises, some
     exercises, and review the Study Guide
     online. 
 -   DUE DATE:  Wednesday, Mar 17, 2010 --
     program #2 (Sorts Comparison) 
 
 WEEK #6:  MWF Mar 22, 24 & 26 
-  Reading Assignment:  
     
     -  Carrano: first half of chapter 10 (Trees)
     
 
 
 
 WEEK #7:  MF Mar 29 & Apr 24 
-  NO CLASS ON WEDNESDAY (Cesar Chavez Day)
 -  Reading Assignment:  
     
     -  Carrano: finish chapter 10 (Trees)
    
 
 
 -   DUE DATE:  Monday, Mar 29, 2010 --
     level three version of program #3 (Medical Clinic) 
 
 SPRING BREAK:  Apr 3 - Apr 11 
 WEEK #8:  MWF Apr 12, 14 & 16  
-  Reading Assignment:  
     
     -  Carrano: finish whatever may remain of chapter 10 (Trees) and first
	  third of chapter 11 (Tables and Priority Queues)
      
 
 
 
 WEEK #9:  MWF Apr 19, 21 & 23 
-  Reading Assignment:  
     
     -  Carrano:  finish chapter 11 (Tables and Priority Queues)
     
 
 
 -  
       QUIZ #2: Monday, Apr 19, 2010 on:
      
     To study for quizzes, participate in class, do the assigned reading
     (including examples and sample code!), do self-test exercises, some
     exercises, and review the Study Guide
     online.
     
 -   DUE DATE:  Wednesday, April 21, 2010
     -- final version of program #3 (Medical Clinic)
 
 WEEK #10:  MWF Apr 26, 28 & 30 
-  Reading Assignment:  
     
     -  Carrano:  first half of chapter 12 (Advanced Implementations of
	  Tables)
     
 
 
 WEEK #11:   MWF May 3, 5 & 7  
-  Reading Assignment:  
     
     -  Carrano: second half of chapter 12 (Advanced Implementations of
	  Tables)
     
 
 
 -  
       QUIZ #2: Monday, May 03, 2010 on:
     
     -  Chapter 8 (Advanced C++ Topics)
     
 -  Chapter 10 (Trees)
     
 
 
     To study for quizzes, participate in class, do the assigned reading
     (including examples and sample code!), do self-test exercises, some
     exercises, and review the Study Guide
     online. 
 
 -    DUE DATE:  Wednesday, May 5,
     2010 -- level three of program #4. 
 
 WEEK #12:  MWF May 10, 12 & 14 
-  Reading Assignment:  
     
     -  Carrano: finish what may remain of chapter 12 (Advanced
	  Implementations of Tables) and work through most of chapter 13
	  (Graphs)
     
 
 
 -    DUE DATE:  Wednesday, May 12, 2010 --
     final version of program #4.
 
 WEEK #13:  MWF May 17, 19 & 21 
-  Reading Assignment:  
     
     -  Carrano:  finish chapter 13 (Graphs)
     
 
 
 -    DUE DATE:  Friday, May 21, 2010 --
     level three of program #5.
 
 WEEK #14:  M May 24 
-  Reading Assignment:  
      
 -    QUIZ #3: Monday, May 24, 2010 on:
     
     -  Binary Trees, 
     
 -  Binary Search Trees, 
     
 -  The ADT Table (Keyed List), 
     
 -  The ADT Priority Queue, 
     
 -  Heaps and Heapsort
     
 -  2-3 Trees, 
     
 -  2-3-4 Trees 
     
 -  and Hashing.
     
 
 
     To study for quizzes, participate in class, do the assigned reading
     (including examples and sample code!), do self-test exercises, some
     exercises, and review the Study Guide
     online. 
 -    DUE DATE:  Wednesday, May 26, 2010 --
     final version of program #5.
 
The final exam slot for the class is:
Friday, May 28 08:30-10:30
The material covered on the final exam will be the same material covered on
the quizzes:
     
     -  Chapter 5 (Recursion as a Problem-Solving Technique)
     
 -  Chapter 9 (Algorithm Efficiency and Sorting)
     
 -  Chapter 8 (Advanced C++ Topics)
     
 -  Chapter 10 (Trees)
     
 -  The ADT Table (Keyed List), 
     
 -  The ADT Priority Queue, 
     
 -  Heaps and Heapsort
     
 -  2-3 Trees, 
     
 -  2-3-4 Trees 
     
 -  and Hashing.