|
|
Disclaimer: This is the plan. This might change. I'll let you know as soon as possible if this plan should change. I'll also keep this page up-to-date.
|
|
|
|
|
|
26 · First day of classes
|
27· Introduction and procedurals
|
28 |
29· Object-oriented methodology
|
30 |
|
|
|
|
|
|
|
2· Labor day (no class)
|
3· Object-oriented methodology
|
4 |
5· Java language review
|
6 |
|
9 |
10· Singly-linked lists
|
11 |
12· Singly-linked lists, applications of
|
14 |
|
16 |
17· Doubly and Circularly linked lists
|
18 |
19· Spare
|
20 |
|
23 |
24 · Exam 1
|
25 |
26· Queues and their applications
|
27 |
|
30 |
|
|||
|
|
|
|
|
|
|
|
1· Stacks
|
2 |
3· Stacks, applications of
|
4 |
|
7 |
8· Recursion and recursion removal
|
9 |
10· Recursive thinking
|
11 |
|
14 |
15· Sorting
|
16 |
17· Sorting
|
18· Mid-semester break (no classes)
|
|
21 |
22· Trees, heaps, and heapsort (as tree)
|
23 |
24 · Algorithm Analysis
|
25 |
|
28 |
29 · Exam 1
|
30 |
31 · Binary Search Trees (BSTs)
|
|
|
|
|
|
|
|
|
|
1 |
|||
|
4 |
5· BSTs, applications of
|
6 |
7· Expression trees and traversals
|
8 |
|
11 |
12· Graphs and topological sort
|
13 |
14· Shortest path, unweighted and weighted
|
15 |
|
18 |
19· Spanning trees and minimum spanning trees
|
20 |
21· Cycle detection and union-find
|
22 |
|
25 |
26· Spare
|
27· Thanksgiving break (No classes)
|
28· Thanksgiving break (No classes)
|
29· Thanksgiving break (No classes)
|
|
|
|
|
|
|
|
2 |
3· Hashing
|
4 |
5· Hashing, applications of
|
6 |
|
9· Final exams
|
10· Final exams
|
11· Reading Day
|
12· Final exams
|
13· Final exams
|
|
16· Final exams
|
17· Final exams
|
18 |
19· Grades due by 4:00PM
|
20 |
|
23 |
24· University closed
|
25· Christmas
|
26 |
27 |
|
30 |
31· University closed
|
|
||