CSC C78F
Data Structures and Algorithm Analysis
| Instructor: |
André Kündgen |
| Tutors: |
Theo Danilov |
Luke Golab |
Mohammad Salvatipour |
| Lecture 30: | Monday 7-9PM | Room S319 | Kündgen |
| Tutorial 3001: | Wednesday 1-2PM |
Room B358(R3231) | Salvatipour |
| Tutorial 3002: | Wednesday 2-3PM |
Room B358(R3231) | Salvatipour |
| Tutorial 3003: | Wednesday 11AM-noon |
Room S208 | Golab |
| Tutorial 3004: | Thursday 6-7PM |
Room S357 | Danilov |
| Office hours: | Monday 5-7PM |
Room S627 | Kündgen |
| Office hour: | Monday 11AM-noon |
Math aid room | Golab |
| Office hour: | Tuesday 2-3PM |
Math aid room | Danilov |
| Office hour: | Wednesday 3-4PM |
Math aid room | Salvatipour |
- Assignment 5 is graded and you can pick it up on top of
the drop box.
- The same goes for regrades of old homeworks.
- If you have questions about the marking of Assignment 5, then
contact Theo or Mohammad directly.
- Here are the inofficial final marks.
They are still subject to change, pending approval by various authorities,
but this is what I submitted.
- I put a lot of time and effort into marking the final exam and
assigning final grades. With a class-size of 94 it will obviously happen
that some people are right on the lower end of a cut-off line. Several
people have already enquired about the possibility of improving their
grades. The curve has been set and the grades have already been submitted.
Except for clerical mistakes, these will not be changed anymore.
- If you have questions about your final then please obtain a
copy from the registrar first and contact the division in case
you believe that a remarking of the exam is warranted and would
change your final grade. Although I believe that my marking was
generous, I will seriously consider all cases that the division
will forward to me.
- I am leaving Toronto on Thursday, December 21. I will check
email only sporadically before mid-January, so it is unlikely
that I will be able to answer to any direct queries before then.
Have a happy holiday!
Relevant reading in CLR
- Sept 11: (review);
1.1 - 4.3, 5.1 - 5.3, 6.1 - 6.3.
- Sept 18: Sorting (Chapt 1 & 8) and
Dictionaries (pg 197, Chap 11.1-2).
- Sept 25: Binary Search Trees (13.1 - 3) and Red-Black Trees (14.1-3)
- Oct 2: Deletion in Red-Black Trees (14.4), Augmenting RBT's (15.1-2)
- Oct 16: Hashing (12.1-3) and the hashing handout
( ps , pdf ).
- Oct 23: Amortized Analysis (18.1-18.4.1)
- Oct 30: Priority queues (7)
- Nov 6: Disjoint Sets (22)
- Nov 13: Elementary Graph Algorithms (23.1-3)
- Nov 20: Minimum Spanning Trees (5.5 & 24)
- Nov 27: Shortest paths in weighted graphs (25.1-2)
- Dec 4: Lower bounds ( ps ,
pdf ), Sorting (9) and adversary arguments
( ps , pdf ).
Last updated December 18, 2000
