@@ -42,11 +42,11 @@ Students must pass the following course and demonstrate mastery of its competenc
42
42
| 6 | Thu, Nov 12 | [ Hash Tables] | Quiz 1
43
43
| 7 | Tue, Nov 17 | Review Day |
44
44
| 8 | Thu, Nov 19 | [ Trees] |
45
- | 9 | Tue, Nov 24 | [ Trees] | Due: Interview Prep 1, Quiz 2
45
+ | 9 | Tue, Nov 24 | [ Trees] | Due: Interview Prep 1
46
46
| - | Thu, Nov 26 | ** Holiday- Thanksgiving** |
47
- | 10 | Tue, Dec 1 | Sorting Algorithms | Due: Interview Prep 2
48
- | 11 | Thu, Dec 3 | Graphs |
49
- | 12 | Tue, Dec 8 | Graphs | Due: Interview Prep 3
47
+ | 10 | Tue, Dec 1 | [ Sorting Algorithms] |
48
+ | 11 | Thu, Dec 3 | Graphs | Quiz 2
49
+ | 12 | Tue, Dec 8 | Graphs | Due: Interview Prep 2
50
50
| 13 | Thu, Dec 10 | Lab Day | Due: [ Final Graph Project]
51
51
52
52
[ Arrays & Linked Lists ] :https://docs.google.com/presentation/d/1166gIzsOn-fMl8UT2US6OCmYX3Z9XNP1Z0rjjKgzrhg/edit#slide=id.g7db18ff8bb_0_63
@@ -61,6 +61,8 @@ Students must pass the following course and demonstrate mastery of its competenc
61
61
62
62
[ Trees ] : https://docs.google.com/presentation/d/16tCYlSxXg-b6ntPl1FllD-Oi7vDtqB9XVFuSQLOxwHc/edit#slide=id.gac88f69591_0_397
63
63
64
+ [ Sorting Algorithms ] :https://docs.google.com/presentation/d/1tfKbsDkx-2cOZzjkGOT8rjN8dUDTfyvJCwMLxqxm5Fs/edit#slide=id.gaeb2fdf359_0_542
65
+
64
66
## Evaluation Criteria
65
67
66
68
To pass this course, students must meet the following requirements:
0 commit comments