Schedule

NOTE: This schedule is tentative, for your reference, and subject to change.

Monday
Wednesday
Friday
Monday, December 31
New Year's Eve
Wednesday, January 2
Introduction to analysis
reading:
  • Epp : 11.2-11.3
  • Carrano & Henry : 10
Friday, January 4
Asymptotics and algorithms
reading:
  • Epp : 11.2-11.3
  • Carrano & Henry : 10
Monday, January 7
Memory
reading:
  • Carrano & Henry : 1.4, C1.1-C1.4, C2.3, C2.5
Wednesday, January 9
Linked Lists
reading:
  • Carrano & Henry : 4
Friday, January 11
Lists
reading:
  • Carrano & Henry : 6
Monday, January 14
Stacks and Array Resizing
reading:
  • Carrano & Henry : 6
Wednesday, January 16
Queues
reading:
  • Carrano & Henry : 13.1-13.2
Friday, January 18
Selection sort, correctness
reading:
  • Carrano & Henry : 11.1.1
  • Epp : 5.5
Monday, January 21
Insertion sort, correctness
reading:
  • Carrano & Henry : 11.1.3
  • Epp : 5.5
Wednesday, January 23
Merge sort, recurrence relations
reading:
  • Carrano & Henry : 11.2.1
  • Epp : 5.6-5.7
Friday, January 25
Merge sort analysis
reading:
  • Epp : 5.6-5.7
Monday, January 28
Recursion, trees
reading:
  • Carrano & Henry : 2, 15.1
Wednesday, January 30
Tree traversals
reading:
  • Carrano & Henry : 15.1-15.2
Friday, February 1
Tree traversal applications
reading:
  • Carrano & Henry : 15.2, 16.1-16.2
Monday, February 4
Dictionary, binary search trees
reading:
  • Carrano & Henry : 18.1, 15.3, 16.3
Wednesday, February 6
Binary search trees
reading:
  • Carrano & Henry : 15.3, 16.3
Friday, February 8
Rotations, AVL tree introduction
reading:
  • Carrano & Henry : 19.5
Monday, February 11
AVL tree operations
reading:
  • Carrano & Henry : 19.5
Wednesday, February 13
AVL tree height
reading:
  • Carrano & Henry : 19.5
Friday, February 15
Hash functions
reading:
  • Carrano & Henry : 18.4.1
Sunday, February 18
Reading break
Tuesday, February 20
Skiing day
Thursday, February 22
Netflix night
Monday, February 25
Hash tables, collision resolution
reading:
  • Carrano & Henry : 18.4.2
Wednesday, February 27
Hash table applications
reading:
  • Carrano & Henry : 18.4.2, 18.4.6
Friday, March 1
B-Tree intro, insertion
reading:
  • Carrano & Henry : 21.3.3
Monday, March 4
B-Tree height
reading:
  • Carrano & Henry : 21.3.3
Wednesday, March 6
Priority queue, binary heap
reading:
  • Carrano & Henry : 13.3, 17.1-17.3
Friday, March 8
Binary heap, insertion and removal
reading:
  • Carrano & Henry : 17.1-17.3
Monday, March 11
heap construction, heapsort
reading:
  • Carrano & Henry : 17.4
Wednesday, March 13
Disjoint sets
Friday, March 15
Disjoint sets, union, find
Monday, March 18
Graphs, introduction
reading:
  • Carrano & Henry : 20.1-20.2
Wednesday, March 20
Graphs, terminology
reading:
  • Carrano & Henry : 20.1-20.2
Friday, March 22
Graphs, representation and implementation
reading:
  • Carrano & Henry : 20.2
Monday, March 25
Breadth-first search
reading:
  • Carrano & Henry : 20.3
Wednesday, March 27
Depth-first search
reading:
  • Carrano & Henry : 20.3
Friday, March 29
Minimum spanning trees, Kruskal's algorithm
reading:
  • Carrano & Henry : 20.4.2-20.4.3
Monday, April 1
Minimum spanning trees, Prim's algorithm
reading:
  • Carrano & Henry : 20.4.3
Wednesday, April 3
Shortest path, Dijkstra's algorithm
reading:
  • Carrano & Henry : 20.4.4