CSE121 Lecture Schedule
 Spring 2003, David Matuszek

All dates and lectures are tentative and subject to change without notice.

      January               February               March                  April  
 S  M Tu  W Th  F  S   S  M Tu  W Th  F  S   S  M Tu  W Th  F  S    S  M Tu  W Th  F  S 
          1  2  3  4                     1                     1          1  2  3  4  5 
 5  6  7  8  9 10 11   2  3  4  5  6  7  8   2  3  4  5  6  7  8    6  7  8  9 10 11 12
12 13 14 15 16 17 18   9 10 11 12 13 14 15   9 10 11 12 13 14 15   13 14 15 16 17 18 19 
19 20 21 22 23 24 25  16 17 18 19 20 21 22  16 17 18 19 20 21 22   20 21 22 23 24 25 26  
26 27 28 29 30 31     23 24 25 26 27 28     23 24 25 26 27 28 29   27 28 29 30
                                            30 31
Date Planned lectures PowerPoint presentations Reading
Jan 13 Intro; academic honesty; arrays; first assignment 01-introduction.ppt Chapters 1 & 2
Jan 15 Ragged arrays; binary search 02-arrays.ppt
Jan 17 Big O notation; logarithms etc. 03-object-references.ppt
Jan 20 Martin Luther King Jr. Day (no classes)
Jan 22 Bubble sort and selection sort 04-searching-arrays.ppt Chapter 3
Jan 24 Insertion sort; the compareTo method 05-logarithms.ppt
06-analysis.ppt
Jan 27 Stacks, queues, and deques; implementation 07-simple-sorting.ppt Chapter 4
Jan 29 Priority queues; postfix 08-stacks.ppt
Jan 31 Translating and evaluating arithmetic expressions 09-stacks-queues-deques.ppt
Feb 3 Singly linked lists 10-postfix.ppt
11-java-comparisons.ppt 		Chapter 5
Feb 5 Sparse arrays; doubly linked lists 12-linked-lists.ppt
Feb 7 Abstract data types; iterators Snow day
Feb 10 Recursion 13-adt.ppt
14-sparse-arrays.ppt		 Chapter 6
Feb 12 Applications of recursion 15-backtracking.ppt
Feb 14 Merge sort; stable sorting 16-mergesort.ppt
17-shellsort.ppt 		Chapter 7
Feb 17 Quicksort; radix sort? Snow day Chapter 7
Feb 19 Review and/or catch up Review
Feb 21 Midterm; Dr. Dave at SIGCSE
Feb 24 Binary trees 18-quicksort.ppt
19-gender.ppt		 Chapter 8
Feb 26 Tree traversals; tree searches 20-adt-2.ppt
21-binary-trees.ppt
Feb 28 Insertions and deletions 22-binary-trees-adt.ppt
Mar 3 Huffman encoding 23-huffman.ppt Chapter 8
Mar 5 Red-black trees I 24-gui_building.ppt Chapter 9
Mar 7 Red-black trees II 25-applets.ppt
Mar 10 Spring break (no classes)
Mar 12  
Mar 14  
Mar 17 Red-black trees 26-big-o-friends.ppt
27-sorted-binary-trees.ppt 		Chapter 10
Mar 19 2-3-4 trees 28-keeping-binary-trees-sorted.ppt
Mar 21 Red-black trees and 2-3-4 trees 29-hashing.ppt Chapter 11
Mar 24 Hash tables and hash functions 30-heapsort.ppt Chapter 11
Mar 26 Heapsort 31-priority-queues.ppt
32-threads.ppt 		Chapter 12
Mar 28 Heaps; priority queues again 33-collections.ppt Chapter 12
Mar 31 Graphs 34-trees.ppt Chapter 13
Apr 2 Searches 35-tree-searching.ppt
Apr 4 Midterm 2 Covers primarily material from last midterm, up to (and including) Threads
Apr 7 Minimum spanning trees 36-graphs.ppt Chapter 13
Apr 9 Topological sorting 37-sets-and-maps.ppt
Apr 11 Connectivity 38-using-maps.ppt
Apr 14 Weighted graphs; minimum spanning tree 39-spanning-trees.ppt
40-algorithm-types.ppt 		Chapter 14
Apr 16 Shortest path problem 41-graph-algorithms.ppt
Apr 18 All-pairs shortest path 42-state-space.ppt
43-alpha-beta.ppt
Apr 21 Intractable problems 44-animation (HTML) Chapter 14
Apr 23 When to use what 45-difficult-problems.ppt
46-impossible-problems.ppt 		Chapter 15
Apr 25 Review and/or catch up Movie  
May 8 Final exam date (4:00-6:00) Cumulative final exam All