Weekly Schedule

For an alternative presentation of the listing of course materials, see the Lectures page.

Pre-Quarter

• Interfaces
  Do problems 5,9,10

Week 1

• Monday (1/7): Lecture
  • Course Overview
  • Overview Notes
  • (Abstract) Data Types, Data Structures, Time/Space Performance
  • Object/Instance Pictures
  • Pass out Academic Integrity Contract
  • Quiz #1: Handed out in class (you can also download it on Monday)
    ( Eclipse Helper project for Quiz)
    Due on Friday, 1/11, at the start of Lecture

• Tuesday (1/8): Lab
  • Program #0: Learning to Use Eclipse, Library, JUnit, Checkmate (not graded)
  • Discuss Academic Integrity Contract
  • Class Pictures

• Wednesday (1/9): Lecture
  • Generic Collection Classes (and their Iterators): Interfaces and Use (e.g., Stack, Queue, PriorityQueue, List, Set, Map)
  • Collections Notes
  • Return signed Academic Integrity Contract

• Thursday (1/10): Lab
  • Discuss/Start Program #1: Using Collection Classes
  • For review see Collection Notes

• Friday (1/11): Lecture
  • Quiz #1 Due at the Start of Class
  • Array Implementation of Generic Collection Classes (and their Iterators)
    using Interfaces, Abstract Classes, Drivers, and JUnit Testing
  • Implementation Notes
  • Quiz #2: Handed out in class (you can also download it on Friday)
    ( Eclipse Helper project for Quiz)
    Due on Monday 1/14, at the start of class

• Friday (1/11): Discussion
  • Discuss material and solve problems from this week's lectures

Week 2

• Monday (1/14): Lecture
  • Quiz #2 Due at the Start of Class
  • Review of Linked Lists and List Processing
  • Linked List Notes

• Tuesday (1/15): Lab
  • Continue working on Program #1: Using Collection Classes

• Wednesday (1/16): Lecture
  • Special Linked Lists: Circular, Header, Trailer, Doubly-linked
  • Special Linked List Notes

• Thursday (1/17): Lab
  • Discuss/Start Program #2: Writing Linked List Implementations

• Friday (1/18): Lecture
  • Review of Recursion and Recursion on Linked Lists
  • Recursion Notes
  • Quiz #3: Handed out in class ( Eclipse Helper project for Quiz)
    Due on Tuesday 1/22, at the start of Lab turn in only paper quiz; include your correct Lab #

• Friday (1/18): Discussion
  • Discuss material and solve problems from this week's lectures

Week 3

• Monday (1/21): Lecture
  • Holiday (Martin Luther King Day): No Class

• Tuesday (1/22): Lab
  • Quiz #3 Due at the Start of Lab
  • Continue working on Program #2: Writing Linked List Implementations

• Wednesday (1/23): Lecture
  • Review of Analysis of Algorithms I: Complexity Classes and big-O Notation
  • AA Notes 1
  • Supplemental Notes

• Thursday (1/24): Lab
  • Continue working on Program #2: Writing Linked List Implementations

• Friday (1/25): Lecture
  • Analysis of Algorithms II: Ω (Omega) and Θ (Theta) notations; analyzing Array, List, and Collection Algorithms
  • AA Notes 2
  • Quiz #4: Handed out in class ( Eclipse Helper project for Quiz)
    Due on Monday, 1/28, at the start of Lecture;
    turn in only paper quiz; include your correct Lab #

• Friday (1/25): Discussion
  • Discuss material and solve problems from this week's lectures

Week 4

• Monday (1/28): Lecture
  • Quiz #4 Due at the Start of Class
  • Trees
  • Tree Notes

• Tuesday (1/29): Lab
  • In-Lab Programming Exam #1: Using Collection Classes

• Wednesday (1/30): Lecture
  • Tree Processing and Traversals
  • BST Notes

• Thursday (1/31): Lab
  • Discuss/Start Program #3: Writing Tree Implementations

• Friday (2/1): Lecture
  • Heaps section in Special Trees
  • Heap Notes
  • Quiz #5: Handed out in class ( Eclipse Helper project for Quiz)
    Due on Monday, 2/4 at the start of Lecture;
    turn in only paper quiz; include your correct Lab #

• Friday (2/1): Discussion
  • Discuss material and solve problems from this week's lectures

Week 5

• Monday (2/4): Lecture
  • Quiz #5 Due at the Start of Class
  • AVL (and other self-balancing search trees)
  • AVL Tree Notes

• Tuesday (2/5): Lab
  • Continue working on Program #3: Writing Tree Implementations

• Wednesday (2/6): Lecture
  • General Trees: Children via Sets and Lists, Binary embedding, Quad Trees, Maps via Digital Trees, Structure Trees (Expressions)
    See Nary Trees and Expression Trees in Special Trees
  • General Notes

• Thursday (2/7): Lab
  • Continue working on Program #3: Writing Tree Implementations

• Friday (2/8): Lecture
  • See Hash Tables section in Collection Classes: (Hash Table) web document:
  • Hashing Notes
  • Quiz #6: Handed out in class ( Eclipse Helper project for Quiz)
    Due on Monday, 2/11, at the start of Lecture;
    turn in paper quiz in class and code via Checkmate

• Friday (2/8): Discussion
  • Discuss material and solve problems from this week's lectures

Week 6

• Monday (2/11): Lecture
  • Quiz #6 Due at the Start of Class
  • Problem Solving and Search Trees: Backtracking
  • Backtracking Notes
  • Graph for 3-Coloring

• Tuesday (2/12): Lab
  • Midterm Front Page
  • Interfaces Document (to be handed out with Midterm)
  • Midterm Exam (please arrive promptly for maximum time)
    

• Wednesday (2/13): Lecture
  • Problem Solving and Search Trees: State-Space Searching
  • State-Space Searching Notes

• Thursday (2/14): Midterm in Lab
  • Discuss/Start Program #4: Hash Tables, etc. Implementations

• Friday (2/15): Lecture
  • Skip Lists (as an alternative to Trees)
  • Skip List Notes
  • No quiz this week.

• Friday (2/15): Discussion
  • Discuss material and solve problems from this week's lectures

Week 7

• Monday (2/18): Lecture
  • Holiday (President's Day): No Class

• Tuesday (2/19): Lab
  • Continue working on Program #4: Hash Tables, etc. Implementations

• Wednesday (2/20): Lecture
  • Sorting 1: Time/Space/Stability, O(N^2) Sorts
  • Slow Sorting Notes

• Thursday (2/21): Lab
  • Continue working on Program #4: Hash Tables, etc. Implementations

• Friday (2/22): Lecture
  • Sorting 2: O(N Log N) Sorts, lower bounds
  • Fast Sorting Notes
  • No quiz this week

• Friday (2/22): Discussion
  • Discuss material and solve problems from this week's lectures

Week 8

• Monday (2/25): Lecture
  • Sorting 3: Sorting without Comparisons: Bucket and Radix Sort
  • Non-Comparison Sorting Notes

• Tuesday (2/26): Lab
  • In-Lab Programming Exam #2: Self-Referential Data Structures

• Wednesday (2/27): Lecture
  • Graphs: Terminology and Representations
  • Graph Notes

• Thursday (2/28): Lab
  • Discuss/Start Program #5: Graph Class and Dijkstra's Algorithm

• Friday (3/1): Lecture
  • Graph Algorithms I: Topological Sorting, Spanning Trees
  • Graph Algorithims Notes 1
  • Graph For Minimum Spanning Tree
  • Quiz #7: Handed out in class ( Eclipse Helper project for Quiz)
    Due on Monday, 3/4, at the start of Lecture;
    turn in both the paper quiz AND the filled-in helper
    (using Checkmate)

• Friday (3/1): Discussion
  • Discuss material and solve problems from this week's lectures

Week 9

• Monday (3/4): Lecture
  • Quiz #7 Due at the Start of Class
  • Graph Algorithms II: Fast Union/Find for computing Connected Components
  • Graph Algorithims Notes 2

• Tuesday (3/5): Lab
  • Continue working on Program #5: Graph Class and Dijkstra's Algorithm

• Wednesday (3/6): Lecture
  • Graph Algorithms III: Extended Dijkstra's Algorithm (Shortest Paths)
  • Dijkstra's Notes
  • Illustrated Example of Dijkstra (from notes)      
  •   Start of Dijkstra (from book)
  •   Finish of Dijkstra (from book)

• Thursday (3/7): Lab
  • Continue working on Program #5: Graph Class and Dijkstra's Algorithm

• Friday (3/8): Lecture
  • String Processing: Quadratic/Linear Searching
  • String Notes)
  • Quiz #8: Handed out in class ( Eclipse Helper project for Quiz)
    Due on Monday, 3/11, at the start of Lecture;
    turn in both the paper quiz AND the filled-in helper
    (using Checkmate)

• Friday (3/8): Discussion
  • Discuss material and solve problems from this week's lectures

Week 10

• Monday (3/11): Lecture
  • Quiz #8 Due at the Start of Class
  • Computer Memory: Introduction
  • Memory Notes

• Tuesday (3/12): Lab
  • Continue working on Program #5

• Wednesday (3/13): Lecture
  • Computer Memory: Data Structures and Algorithms for Searching
  • B-Tree Notes
    B-Tree operations

• Thursday (3/14): Lab
  • Continue working on Program #5

• Friday (3/15): Lecture
  • Computer Memory: Data Structures and Algorithms for Sorting
  • B-Tree/Merge Notes
    

• Friday (3/15): Discussion
  • Course Review

Final Exams Week

• Friday (3/22): Final Exam
  • 1:30pm - 3:30pm