Lecturer: Derek Corneil, SF
3301B, 978-8954, dgc@cs.utoronto.ca
Lectures: Tuesday 3:10 - 5:00 in WB 144
Tutorial: Thursday 3:10 - 4:00 in WB 144 (Xiang Cao - caox@cs.utoronto.ca)
NOTICE:
Apr. 21 by Prof. Corneil:
The projects have been marked and are available
for pick-up outside Prof. Corneil's office
(SF3301B).
Have a great summer.
D.C.
Apr. 1 by Prof. Corneil:
There will be no lecture on Tuesday, April 8. Instead,
anyone who wants
to meet with me for advice on his/her project should go to SF3301B.
The projects are due by the end of day on Friday, April 11. If I am not
in, please put the project under my office door. Note, that under
University regulations, I am not allowed to accept late projects unless
there is a formal petition (e.g. for medical or personal reasons).
Once the projects have been marked and are ready to be returned, there
will be a note on the website. The projects will be in a box outside my
office. Please do not contact me asking if I'm finished - instead check
the website.
Please make sure that you return any material that you have borrowed from
me. Such material should be returned when you hand in your project.
Mar. 31 by Xiang Cao:
The last two tutorials (Apr 3 & Apr 10) are cancelled.
All the marks of assignments are posted below, please check your marks. If there is any problem, send an e-mail to Xiang Cao please.
Marking Scheme and Timetable:
|
Assignment |
Hand-out Date |
Due Date |
Date Returned |
Marks |
|
Sept. 19 |
Oct. 3 |
Oct. 10 |
10 | |
| Assn. 2 |
Oct. 10 |
Oct. 24 |
Oct. 31 |
10 |
| Assn. 3 |
Oct. 31 |
Nov. 14 |
Nov. 21 |
10 |
| Assn. 4 |
Nov. 21 |
Dec. 5 |
Jan. 9 |
10 |
| Assn. 5 |
Jan. 9 |
Jan. 23 |
Jan. 30 |
10 |
| Assn. 6 |
Jan. 30 |
Feb. 13 |
Feb. 27 |
10 |
| Assn. 7 ( Figure ) |
Feb. 27 |
Mar. 13 |
Mar. 20 |
10 |
|
Project |
April 11 |
20 | ||
|
Class part. |
10 |
Note: The lateness penalty is 10% per day - unless advance permission is obtained; assignments that are over 1 week will not be accepted. Unless cooperation is explicitly allowed, all work must be done independently. Throughout the assignments, you will be asked to design an algorithm. Marks will be awarded according to the philosophy of: "the better the algorithm, the better the mark". All assignments will have "EXTRA" questions. It is up to you whether or not you try these questions. Full marks can be achieved without trying them and marks that you receive on these questions can only help your final mark.
Marks of Assignments:
|
Student # |
Assn 1 |
Extra 1 |
Assn 2 |
Extra 2 |
Assn 3 |
Extra 3 |
Assn 4 |
Extra 4 |
Assn 5 |
Extra 5 |
Assn 6 |
Extra 6 |
Assn 7 |
Extra 7 |
|
990298637 |
6 |
7.5 |
8.5 |
B+ |
4 |
8 |
3 |
|||||||
|
992514604 |
8.5 |
8 |
B+ |
6 |
B |
7.5 |
A+ |
8 |
9.5 |
A- |
7.5 |
B | ||
|
992310566 |
8 |
7.5 |
B |
9 |
B |
9 |
8 |
8.5 |
4.5 |
|||||
|
992230750 |
8 |
8.5 |
A |
9.5 |
B+ |
9 |
8.5 |
7.5 |
B |
7.5 |
||||
|
992041492 |
8 |
8 |
B+ |
7.5 |
A |
9 |
A- |
9 |
B |
9 |
A- |
9 |
||
|
992201229 |
6 |
6.5 |
8 |
7.5 |
5.5 |
A- |
4.5 |
7.5 |
B | |||||
|
992435361 |
7.5 |
8 |
A- |
8 |
C+ |
8.5 |
9 |
A- |
8.5 |
A- |
8.5 |
|||
|
992190972 |
5.5 |
6.5 |
6.5 |
B- |
7.5 |
9 |
B+ |
7.5 |
B+ |
7.5 |
||||
|
991313565 |
8 |
7 |
4 |
8.5 |
A |
8 |
9 |
A- |
7 |
|||||
|
992558415 |
6 |
6.5 |
B |
8 |
8 |
9 |
10 |
A- |
7 |
|||||
|
991740639 |
9 |
7.5 |
B+ |
8.5 |
6 |
B |
7.5 |
B |
7 |
B |
9 |
|||
|
990774907 |
8 |
7.5 |
B |
9 |
B+ |
7.5 |
7.5 |
5.5 |
7.5 |
B- | ||||
|
992295994 |
8 |
6.5 |
B+ |
8.5 |
A- |
7.5 |
9.5 |
9 |
9.5 |
|||||
|
992310478 |
5 |
7 |
B |
5.5 |
7.5 |
5 |
2.5 |
|||||||
|
992294174 |
7.5 |
A- |
7 |
B+ |
8 |
A- |
7 |
7.5 |
5 |
B |
9 |
Approximate Course Outline: (number of lecture hours)
Introduction (4)
what is a beautiful
algorithm?
development of
pseudo-language
efficiency issues
Data Storage (14)
sorting
searching
heaps and other data
structures
Number Theory (9)
factoring,
primes
application to
cryptography
multiplying integers and
matrices
Graph Theory (20)
search
strategies
games on graphs
distance
calculation
minimum spanning
tree
touring a graph
Miscellaneous (5)
numerical
geometrical
