Monday | T | Wednesday | R | F | Saturday |
---|---|---|---|---|---|
8
|
9
|
10
Before Class:
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Class: Introduction, Syllabus and Algorithm Analysis Algorithm Analysis (exercises) Recursion (GCD.java, BinarySearch.java) Divide and Conquer (exercises) Class Notes |
11
|
12
|
13
|
15
Due:
|
Deadline for full refund
16
|
17
Before Class:
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Class: Algorithm Analysis Follow-up Heaps (exercises) Sorting Algorithms (exercises) |
18
|
19
|
20
|
22
Due:
|
23
|
24
Before Class:
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Class: Tracing Sorting Algorithms (exercises) Stacks and Queues (exercises) Class Notes |
25
|
26
|
27
|
29
|
30
|
31
Before Class:
![]() ![]() ![]() ![]() ![]() Class: Linked Lists (exercises) Binary Search Trees (exercises) Hashing (exercises) |
Monday | T | Wednesday | R | F | Saturday |
---|---|---|---|---|---|
1
|
2
|
3
|
|||
5
Due:
|
6
|
7
Before Class:
![]() Class: Hashing (exercises) Dynamic Programming
|
8
|
9
|
10
|
12
Due:
|
13
|
14
Before Class:
![]() ![]() ![]() Class: Greedy Algorithms (exercises) |
15
|
16
|
17
|
19
Due:
|
20
College Career Fair (SCCT Lobby 10 AM - 2 PM)
|
21
Before Class:
![]() Class: Elementary Graph Algorithms (exercises) |
22
|
23
|
24
|
26
Due:
|
27
|
28
Before Class:
![]() ![]() ![]() Class: Elementary Graph Algorithms (cont'd) (exercises) Class Notes |
29
|
Monday | T | Wednesday | R | F | Saturday |
---|---|---|---|---|---|
Deadline to Withdraw with a WP
1
|
2
|
||||
4
Due:
|
5
|
6
Before Class:
![]() ![]() Class: Elementary Graph Algorithms (cont'd) (exercises) Spanning Trees (exercises) |
7
|
8
|
9
|
11
|
12
|
13
Before Class:
![]() ![]() Class: Minimum Spanning Trees (exercises) Single-Source Shortest Paths (exercises)
|
14
|
15
|
16
|
18
Spring Break
|
19
Spring Break
|
20
Spring Break
|
21
Spring Break
|
22
Spring Break
|
23
|
25
Due:
|
26
|
27
Before Class:
![]() ![]() Class: Parallel Algorithms (slides) |
28
|
29
|
30
|
Monday | T | Wednesday | R | F | Saturday |
---|---|---|---|---|---|
1
|
2
|
3
|
4
|
5
|
6
|
8
Due:
|
9
|
10
|
11
|
12
|
13
|
15
|
16
|
17
Before Class:
![]() Class: Approximation Algorithms (slides) |
18
|
19
|
20
|
22
Due:
|
23
Due:
![]() |
Last Day of Class
24
|
25
|
26
|
27
|
29
|
Course Evaluation Surveys close; Study Day
30
|
Monday | T | Wednesday | R | F | Saturday |
---|---|---|---|---|---|
1
|
2
|
3
|
4
|