A4 sample solutions posted
Sample solutions to A4 are posted on the Assignments
page. Apologies for the delay. Class average on A4 was 73.4% (not that it
means much). The class term average going into the exam is approximately 67%,
or 40/60.
Office hours today
Today's (Tuesday's) office hours are 11-5pm (slightly extended from previous
announcement). I will not be holding office hours tomorrow, though I will be
answering email.
I will leave uncollected A4 and Test 2 papers outside my office
following my office hours--please collect only your own (or get permission
from your friends) and try to preserve other student's privacy by
avoiding looking at other papers.
Important note about unauthorized aids
The Registrar's office has requested that the following notice be included
on final exams:
It is an academic offence for students to possess the following items at their examination desks: cell phones, pagers of any kind, IPODs, MP3 players, wristwatch computers, personal digital assistants (e.g., palm pilots) or any other device that is electronic. If any of these items are in your possession now, please ensure they are turned off and put them with your belongings at the front (or side) of the room before the examination begins --- no penalty will be imposed. A penalty WILL BE imposed if any of these items are kept at your examination desk.Please note, students are NOT allowed to petition to RE-WRITE a final examination.
Please ensure that you do not possess any electronic devices at your desk during the exam. Though they won't help you with the exam, they can get you into a lot of trouble if you have them. The University has become extremely strict with such devices, after some students (probably non-CS) were caught trying to cheat with them, and neither I nor the department have any control over consequences.
A4 marks posted
Assignment 4 marks are now posted online.
Final exam notes
Some notes on what to expect on the final exam are posted on the
Tests and Exam page.
Please note: you are permitted one 8.5" by 11" handwritten sheet
as your only aid for the exam, if you so choose.
Term Test 2 solutions
Sample solutions, marking scheme, and marking notes are now posted on the
Tests and Exam page.
Pre-exam office hours
My remaining pre-exam office hours will be as following (or by appointment):
Wednesday, April 19: 12-3pm
Tuesday, April 25: 11-3pm
You can pick up uncollected work during these office hours.
A4 will likely be available by Tuesday. After Tuesday, I will leave any
uncollected work outside my office for pickup.
Test 2 marks posted
Test 2 marks are now included in the online marks posting.
You can pick up your test (and any other uncollected work) at my office hours.
Office hours
Today's office hour will be as normal, 11:30-12:30. I might be around in
the afternoon as well.
Next week, I will be available on Monday and Wednesday afternoon,
April 17 and 19. Make an appointment or try to drop by.
I will also hold a special pre-exam office hour probably Tuesday afternoon,
April 25, or as requested.
Study/exam week office hours
My office hours will be changing for study and exam week.
I'll post them here once I've figured them out (this is also an ideal time
to email me to request specific times).
Assignment 4 typo correction, clarifications, and a hint
All posted to the usual place.
A3 sample solutions posted
Sample solutions to A3 are posted on the Assignments
page.
Assignment 4 posted
The last assignment is available from the usual place.
A3 marks posted
Assignment 3 marks are now available from the online marks.
The TA will return the assignments in tutorial on Friday.
More Test 2 notes
I've added a few more thoughts regarding Test 2 on the
Tests page.
Test 2 information
Coverage and details for test 2 were discussed in today's lecture.
Additional details will be posted to the Tests page.
Speaking of tests, make sure you check the
final exam schedule,
now available.
A3 clarification
For question 2, you must give a divide-and-conquer algorithm;
any other type of algorithm will receive only part marks.
(The whole point of the question is to make sure that you review and
understand the closest-points algorithm presented in class.)
A3 reminder
You may use any results that are proved in the textbook, in lecture, or
in tutorial. For example, you do not have to reprove Ford-Fulkerson's
algorithm or closest pair of points algorithm if you use it to solve a
question on the assignment.
Course evaluations week
This week we'll be doing course evaluations in lecture and in tutorial.
Be sure to attend and give us feedback.
A2 extra credit now online
For those who handed in A2 by the original due date, the online marks
now include the extra credit that I promised. A2 remarks are also now
included online.
A3 update
A slight update to A3... I've removed part (d) of question 1.
The online handout has been updated.
A2 marks available
Marks for assignment 2 are now posted online.
The TA will return the assignments in tutorial on Friday.
Assignment 3 posted
Assignment 3 is now available on the Assignments
page.
A2 update
Unfortunately, A2 won't be returned until next Friday. Marks should be
available online by Tuesday, though. If you need to enquire about the
marking of your assignment before then, please send me an email.
Test 1 returned, marks posted
Test 1 was returned in class today. If you didn't pick it up, you can pick
it up during my office hours. Please check the
online marks posting to
make sure your grade is recorded correctly.
Though the marks may have been a little lower than you expected, don't worry. Solving problems with these techniques take experience, which you will gain through the course. It is normal for students to raise their grades at the end of a course like this. I'll also adjust the format of the next test (based on student feedback) to make it less stressful.
The TA said she would try to mark and return A2 on Friday in tutorial; if so, I will have the uncollected assignments at my office hour on Monday.
A2 hints
A little hint has been posted to the Assignments
page.
Assignment 1 solutions
Sample solutions to Assignment 1 have been posted on the
Assignments page.
Reading Week: change of office hours
Due to Reading Week, I am changing my office hours. They will be:
You can always email me if you can't make it during this time.
A2 extension granted
Due to several requests for relief, I will accept A2 until 12:00 noon
on Monday, February 27. There is a CSC373S drop box near SB 1155
(just down the hall from the CS computer lab), or you can hand it to
me in office hours.
To be fair to those students who worked hard to make the original due date, extra credit will be granted to those who hand in to the TA on Friday.
Week 6 notes posted
I have finally posted the week 6 notes on the Lectures
page. Apologies for the delay.
A2 posted
Assignment 2 is available on the Assignments page.
Oodles of announcements today!
Online marks available
Please check that the online marks posting correctly reports your marks.
Also, be sure to change your password when you log in to protect your grades
from anyone else who might know your student number.
A1 return (continued)
For those of you who haven't picked up A1 yet, they are available on my
office door. Please read and heed the comments from the TA -- they are
designed to help you improve you proof-writing skills, particularly for
the rest of the course. The class average on the assignment was around
44/60, not that it means anything.
Toward A1 solutions
A link containing hints towards A1 solutions have been added to the
Assignments page.
Sorry but they aren't full solutions.
Lecture summaries posted
I've recently surprised (and been surprised by) a few students that
lecture summaries are posted on the Lectures page.
I'm not sure how you missed the links when looking up your weekly
homework readings, but they are there.
Dynamic Programming talk Thursday on Downtown Campus
The CSSU, the computer science students' union on the St. George campus,
is hosting a technical talk on dynamic programming this Thursday at noon.
The seminar will be given by Igor Naveriouk, a UofT graduate student and
head of the UofT Programming Contest Team. The talk will probably concentrate
more on problem solving using dynamic programming, but should be very
interesting if you happen to be downtown Thursday.
Details are here.
A1 return
Assignment 1 has been marked and is ready for return.
You can pick up your assignment during my office hours on
Monday. Look for additional information posted Monday.
Test 1 information
Some details regarding Term Test 1 have been posted to the
Tests page.
A1 Q4 clarification
The following clarification was added to the
Assignments page:
For question 4, once you have an algorithm, also give a short proof that your algorithm is correct. A full proof is not necessary for this question. You should also justify that your algorithm is efficient (i.e., polynomial).
The phrase "and give a short proof that your algorithm is correct." clarifying this was accidentally omitted from the assignment handout.
Minor clarification to A1 Q3
I've posted a minor clarification for Q3 on the
Assignments page, since some students seemed
a little confused on what they needed to prove.
Reference for red-blue generic algorithm MST problem
Note that the "red-blue" generic algorithm for minimum spanning trees,
and the associated proof, were first presented by Robert Tarjan in his book:
"Data Structures and Network Algorithms".
We've been told that this book is available for free through the
UofT library: Tarjan's book.
New TA
We've had a change in TAs for the course.
The new TA is Tobi Kral, whom you will meet in this week's tutorial.
Assignment 1 released
The first homework has been posted to the Assignments
page. Note that it is due at the start of tutorial -- late assignments will
not be accepted. Start now, and ask questions in tutorial or office hours!
Lecture summaries updated
The lecture summaries on the Lectures page
have been updated. They might help with completing your assignment.
Lecture topics and readings
The lectures and assigned readings page is now up.
Before lecture I'll be posting the topic(s) to be covered and textbook
readings I expect you to have read before class. After lecture I intend
to post some notes outlining what I covered, particularly if it differs
from the textbook.
No tutorial this week
There will be no tutorial held this week. The first tutorial will be during
the second week of classes, on January 13.
Textbook in the bookstore
The textbook is available in the bookstore, but it is listed under the course
CSC 363 on their textbook lists. This is a mistake. It should say 373 (363 is
another course, but it isn't being offered at UTM this semester).
Welcome!
Welcome to CSC 373! All course announcements will be posted to this page,
in reverse chronological order. Be sure to check back often.
|
|