CPSC 250A: Data Structures and Algorithms
Fall 2011: Class Notes

Date Topic Associated Reading Class Notes
Aug 31
  • Course Overview
  • Introduction to C++
  • Weiss Chapter 0
  
Sep 2
  • C++ Types and Control Structures
  • Compiling with GCC
  • Weiss Chapter 1
  
Sep 5
  • C++ Functions and Parameter Passing
  • Makefiles
  • Weiss Chapter 2
  
Sep 7
  • C++ Pointers
  • Weiss Chapter 3
  
Sep 9
  • C++ Arrays and Strings
  • Weiss Chapter 11
  
Sep 12
  • C++ Objects
  • Weiss Sections 4.1 - 4.6
  
Sep 14
  • More C++ Objects
  • Weiss Sections 4.7 - 4.17
  
Sep 16
  • Operator Overloading
  • Weiss Chapter 5
  
Sep 19
  • More Classes
    
Sep 21
  • String Operations
    
Sep 23
  • C++ Inheritance
  • Weiss Chapter 6
  
Sep 26
  • Templates
  • Weiss Chapter 7
  
Sep 28
  • C++ Exceptions
  • Weiss Chapter 8
  
Sep 30
  • Review
    
Oct 3 Test 1
Oct 5
  • Functions as Objects and Iterators
    
Oct 8
  • C++ I/O
  • Weiss Chapter 9
  
Oct 10
  • C-style C++
  • Weiss Chapter 12
  
Oct 12
  • Binary Search Trees
    
Oct 14
  • AVL Trees
  • Lewis Section 7.1
  
Oct 24
  • AVL Tree Implementation
    
Oct 26
  • AVL Tree Analysis
    
Oct 28
  • A-B Trees
  • Lewis Section 7.2
  
Oct 31
  • A-B Tree Implementation
    
Nov 2
  • A-B Tree Analysis
    
Nov 4
  • Red-black Tree
    
Nov 7
  • Splay Tree
  • Lewis Section 7.3
  
Nov 9
  • Review
    
Nov 11 No Class
Nov 14 Test 2
Nov 16
  • Graphs
  • Lewis Section 12.1
  
Nov 18
  • Graph Searching
  • Lewis Section 12.2
  
Nov 21 No Class
Nov 28
  • Shortest Path
  • Lewis Section 12.2
  
Nov 30
  • Least-cost Path
  • Lewis Section 12.3
Dec 2
  • Minimum Spanning Tree
  • Lewis Section 12.3