September | ||||||
Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
21 | 22 | 23 | 24
12:30-13:20 Lecture
MGH 241 Abstract data types; worst case running time MW 1.1-1.2, 2.1-2.4.2
14:00-15:00 OH (Martin)
CSE 538 |
25
Section
Eclipse and binary search tree review BinarySearchTree.java, Eclipse intro, Eclipse using Java 7
10:00-11:00 OH (Conrad)
CSE 218 |
26
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 Big O, big Omega, big Theta; rules of sum and product for big O |
27 |
28 | 29
12:30-13:20 Lecture
MGH 241 Dictionary ADT; implementations by unsorted and sorted lists, binary search trees MW 4.1-4.3
13:30-14:30 OH (Vivian)
CSE 220 |
30
12:30-13:30 OH (Alon)
CSE 220 |
01
12:30 HW1 due
12:30-13:20 Lecture
MGH 241 Quicksort implemented recursively and using a stack MW 3.6 Quicksort handout
14:00-15:00 OH (Martin)
CSE 538 |
02
Section
HW1 solutions, quicksort-with-stack simulation
10:00-11:00 OH (Conrad)
CSE 218 |
03
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 AVL trees: height, lookUp MW 4.4 |
04 |
October | ||||||
Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
05 | 06
12:30-13:20 Lecture
MGH 241 AVL trees: insert
13:30-14:30 OH (Vivian)
CSE 220 |
07
12:30-13:30 OH (Alon)
CSE 220 |
08
12:30-13:20 Lecture
MGH 241 AVL trees: remove; splay trees MW 4.5
14:00-15:00 OH (Martin)
CSE 538
22:00 HW2 due
|
09
Section
AVL insert and remove examples; B-trees
10:00-11:00 OH (Conrad)
CSE 218 |
10
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 Splay method |
11 |
12 | 13
12:30-13:20 Lecture
MGH 241 Hashing MW 5.1-5.4
13:30-14:30 OH (Vivian)
CSE 220 |
14
12:30-13:30 OH (Alon)
CSE 220 |
15
12:30 HW3 due
12:30-13:20 Lecture
MGH 241 Rehashing MW 5.5
14:00-15:00 OH (Martin)
CSE 538 |
16
Section
HW3 solutions, program testing, recursive splay
10:00-11:00 OH (Conrad)
CSE 218 |
17
10:30-11:20 OH (Matthew)
CSE 220 |
18 |
19 | 20
12:30-13:20 Lecture
MGH 241 Graphs MW 9.1
13:30-14:30 OH (Vivian)
CSE 220 |
21
12:30-13:30 OH (Alon)
CSE 220 |
22
12:30-13:20 Lecture
MGH 241 Topological sort MW 9.2
14:00-15:00 OH (Martin)
CSE 538 |
23
Section
HW4 help, hashing functions for string keys
10:00-11:00 OH (Conrad)
CSE 218 |
24
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 Breadth-first search MW 9.3.1
22:00 HW4 due
|
25 |
26
15:00-16:00 OH (Conrad & Alon)
CSE 403 Midterm review |
27
12:30-13:20 Midterm exam
MGH 241
13:30-14:30 OH (Vivian)
CSE 220 |
28
12:30-13:30 OH (Alon)
CSE 220 |
29
12:30-13:20 Lecture
MGH 241 Intro to parallelism DG 2
14:00-15:00 OH (Martin)
CSE 538 |
30
Section
Applications of breadth-first search
10:00-11:00 OH (Conrad)
CSE 218 |
31
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 Fork-Join programs DG 3 |
01 |
November | ||||||
Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
02 | 03
10:30-11:20 OH (Vivian)
CSE 021
12:30 HW5 due
12:30-13:20 Lecture
MGH 241 Analyzing parallel programs; parallel prefix DG 4-5 |
04
12:30-13:30 OH (Alon)
CSE 220 |
05
12:30-13:20 Lecture
MGH 241 Parallel quicksort
14:00-15:00 OH (Martin)
CSE 538 |
06
Section
Fork-join examples
10:00-11:00 OH (Conrad)
CSE 218 |
07
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 Parallel mergesort |
08 |
09 | 10
12:30-13:20 Lecture
MGH 241 Concurrency and locks DG 6
13:30-14:30 OH (Vivian)
CSE 220 |
11
Veterans' Day
|
12
12:30-13:20 Lecture
MGH 241 Priority queues: heap insert MW 6.1-6.3
14:00-15:00 OH (Martin)
CSE 538 |
13
Section
HW6 help, concurrency and locks
10:00-11:00 OH (Conrad)
CSE 218 |
14
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 Heap deleteMin, buildHeap MW 7.5 |
15 |
16 | 17
12:30-13:20 Lecture
MGH 241 buildheap analysis, heapsort MW 9.3.2
13:30-14:30 OH (Vivian)
CSE 220 |
18
12:30-13:30 OH (Alon)
CSE 220 |
19
12:30-13:20 Lecture
MGH 241 Dijkstra's algorithm
14:00-15:00 OH (Martin)
CSE 538 |
20
Section
HW6 help, Huffman coding via heaps
10:00-11:00 OH (Conrad)
CSE 218 |
21
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 Correctness and analysis of Dijkstra's algorithm
22:00 HW6 due
|
22 |
23 | 24
12:30-13:20 Lecture
MGH 241 Minimum spanning trees, disjoint set ADT MW 9.5, 8.1-8.3
13:30-14:30 OH (Vivian)
CSE 220 |
25
12:30-13:30 OH (Alon)
CSE 220 |
26
12:30-13:20 Lecture
MGH 241 Weighted union, path compression MW 8.4-8.5
14:00-15:00 OH (Martin)
CSE 538 |
27
Thanksgiving
|
28
Day after Thanksgiving
|
29 |
30 | 01
12:30-13:20 Lecture
MGH 241 Analysis of Kruskal's algorithm
13:30-14:30 OH (Vivian)
CSE 220 |
02
12:30-13:30 OH (Alon)
CSE 220 |
03
12:30 HW7 due
12:30-13:20 Lecture
MGH 241 Correctness of Kruskal's algorithm; NP-complete problems MW 9.7
14:00-15:00 OH (Martin)
CSE 538 |
04
10:00-11:00 OH (Conrad)
CSE 218 |
05
10:30-11:20 OH (Matthew)
CSE 220
12:30-13:20 Lecture
MGH 241 NP-completeness |
06 |
December | ||||||
Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
07 | 08 | 09
12:30-13:30 OH (Alon)
CSE 220 |
10
15:00-17:00 OH (Conrad)
4th floor breakout |
11
08:30-10:20 Final exam
MGH 241 |
12 | 13 |