CS 261 Course Outline

Schedule

Office Hours

Textbooks

Course Outline

Grading

Demonstrations

Sample Code

Assignments

Students' Work

Viewgraphs

Additional Materials

Related URLs

Archived Mail

Home

 1   Course Introduction    Handouts     
 2   Unix Introduction      Handout      
 1   Java Review            MW 1-2, MM 2-3, Core 1-3 

 2   Stack                  MW 11.2 and 15.1.1, MM 6, RL 4
 2   Queue                  MW 15.1.2, MM 7, RL 4
 3   List                   MW 16, MM 4, RL 5

 1   Midterm  I                                     

 2   Binary Tree            MW 17, MM 9, RL 8 
 2   Binary Search Tree     MW 18.1-3, MM 9.5, RL 8 
 2   Heap                   MW 20, MM 10.1, RL 12 
 2   Hash Table             MW 19, MM 11.3-5, RL 11

 1   Midterm II                                      

 1   Sets                   MW 23.1, 23.3-5 
 1   Graphs                 MW 14.1, MM 14, RL 13 
 2   Minimum Spanning Tree  MW 23.2.1, RL 13 
 2   Shortest Paths         MW 14.3, MM 14.4, RL 14 
---
29
      Final -- 9:30, June 12, Tuesday
  • Symbol MW indicates the book Data Structures & Problem Solving Using Java by Mark A. Weiss.
  • Symbol MM indicates the book Data Structures & Other Objects Using Java by Michael Main.
  • Symbol RL indicates the book Data Structures & Algorithms in Java by Robert Lafore.