EBoards

Here you can find a record of what we talked about each day of class (more of less).

• EBoard 42: Evaluate and debrief (held Friday, 8 December 2017)

• EBoard 41: Wrapup (held Wednesday, 6 December 2017)

• EBoard 40: Knuth-Morris-Pratt, concluded (held Monday, 4 December 2017)

• EBoard 39: Improved string-matching algorithms (held Friday, 1 December 2017)

• EBoard 38: Basics of string matching (held Wednesday, 29 November 2017)

• EBoard 37: Dynamic programming (3) (held Monday, 27 November 2017)

• EBoard 36: Discussion of exam 2 (held Wednesday, 22 November 2017)

• EBoard 35: Dynamic programming (2) (held Monday, 20 November 2017)

• EBoard 34: Dynamic programming (1) (held Friday, 17 November 2017)

• EBoard 33: Network flows (held Wednesday, 15 November 2017)

• EBoard 32: Sets and union-find (held Monday, 13 November 2017)

• EBoard 31: Implementing graphs (held Friday, 10 November 2017)

• EBoard 30: Minimum spanning trees, continued (held Wednesday, 8 November 2017)

• EBoard 29: Minimum spanning trees (held Monday, 6 November 2017)

• EBoard 28: Shortest paths (held Monday, 6 November 2017)

• EBoard 27: Program verification (4) (held Wednesday, 1 November 2017)

• EBoard 26: Program verification (3) (held Monday, 30 October 2017)

• EBoard 25: Program verification (2) (held Friday, 27 October 2017)

• EBoard 24: Program verification (1) (held Wednesday, 25 October 2017)

• EBoard 23: Detour - Skip lists (held Monday, 23 October 2017)

• EBoard 22: Pause for breath (held Friday, 13 October 2017)

• EBoard 21: Tries (held Wednesday, 11 October 2017)

• EBoard 20: Discussion of exam 1 (held Sunday, 8 October 2017)

• EBoard 19: Radix sort (held Friday, 6 October 2017)

• EBoard 18: O(n) sorting algorithms (held Wednesday, 4 October 2017)

• EBoard 17: Lower bounds on sorting algorithms (held Monday, 2 October 2017)

• EBoard 16: Sorting (held Friday, 29 September 2017)

• EBoard 15: Pause for breath (held Wednesday, 27 September 2017)

• EBoard 14: 2-3 trees (held Monday, 25 September 2017)

• EBoard 11: Binary search trees (held Monday, 18 September 2017)

• EBoard 10: More on dictionaries (held Friday, 15 September 2017)

• EBoard 9: Hash Tables (held Wednesday, 13 September 2017)

• EBoard 8: Roles of data structures and abstract data types (held Monday, 11 September 2017)

• EBoard 7: The Master Theorem (held Friday, 8 September 2017)

• EBoard 6: Asymptotic analysis and recurrence relations (held Wednesday, 6 September 2017)

• EBoard 5: Divide-and-conquer algorithms and structures (held Monday, 4 September 2017)

• EBoard 4: Reflective activities (held Friday, 1 September 2017)

• EBoard 3: Asymptotic analysis (held Wednesday, 30 August 2017)

• EBoard 2: Shortest path (held Monday, 28 August 2017)

• EBoard 1: An introduction to the course (held Friday, 25 August 2017)