![]() Department of Computer Science and Engineering |
|
CSE 247 / 502N |
Fall 2016 |
![]() |
(subject to change) | ![]() |
Module | Date | Logistics | Preparation | Notes | Assigned | Due | ||||
---|---|---|---|---|---|---|---|---|---|---|
0. Introduction
[details] [ slides ] |
10 |
|
Lecture |
|
|
|||||
50 |
|
Studios |
|
|
Studio 0 | Studio 0 | ||||
1. Asymptotic Complexity
[details] [ slides ] |
10 |
|
![]() ![]() |
|
|
|||||
50 |
|
Studios | |
|
Studio 1 | Studio 1 | ||||
2. Simple Data Structures
[details] [ slides ] |
10 |
|
Lecture |
|
|
|||||
50 |
|
Studios | |
|
Studio 2 | Studio 2 | ||||
3. Priority Queues
[details] [ slides ] |
10 |
|
Lecture |
Text 6.5 (162–169) |
|
Lab 3 | ||||
50 |
|
Studios | |
|
Studio 3 | Studio 3 | ||||
4. Recurrences I
[details] [ slides ] |
10 |
|
Lecture |
Text 4.4 (88–92) |
|
|||||
50 |
|
Studios | |
|
Studio 4 |
Studio 4 Lab 3 |
||||
5. Recurrences II
[details] [ slides ] |
10 |
|
![]() ![]() |
|
|
|||||
50 |
|
Studios | |
|
Studio 5 | Studio 5 | ||||
6. Shortest Paths
[details] [ slides ] |
10 |
|
Lecture |
|
|
Lab 6 | ||||
50 |
|
Free | |
|
||||||
75 |
|
Exam | |
|
||||||
7. Sorting
[details] [ slides ] |
10 |
|
Lecture |
|
|
Lab 7 | ||||
50 |
|
Studios | |
|
Studio 7 | Studio 7 | ||||
8. Hashcodes
[details] [ slides ] |
10 |
|
Lecture |
|
|
|||||
50 |
|
Studios | |
|
Studio 8 |
Studio 8 Lab 6 |
||||
9. Hash Tables
[details] [ slides ] |
10 |
|
Lecture |
|
|
Lab 9 | ||||
50 |
|
Studios | |
|
Lab 7 | |||||
75 |
|
Exam | |
|
||||||
10. Ordered Sets
[details] [ slides ] |
10 |
|
Lecture |
|
|
|||||
50 |
|
Studios | |
|
Studio 10 | Studio 10 | ||||
11. Searching Graphs
[details] [ slides ] |
10 |
|
Lecture |
|
|
|||||
50 |
|
Studios | |
|
Studio 11 |
Studio 11 Lab 9 |
||||
12. Diffie–Hellman
[details] [ slides ] |
10 |
|
Lecture |
|
|
|||||
50 |
|
Studios | |
|
Studio 12 Lab 12 |
Studio 12 | ||||
13. Review
[details] [ slides ] |
10 |
|
Lecture |
|
|
|||||
50 |
|
Studios | |
|
Lab 12 | |||||
60 |
|
Exam | |
|
||||||
70 |
|
Exam | |
|