CSC 366: "Data Structures and Algorithm Analysis"
St. George Campus -- Spring Term 2000
Old Announcements
- Monday 6 March 2000:
- Solutions for some questions are now available. The test will cover material in questions 1-5 (6 and 7 will
not be covered by this test).
- Sunday 5 March 2000:
- I will have office hours Monday as usual. Please take advantage of this if you have some questions.
- To prepare for the next test, you should be able to
- Write down a Turing Machine from a simple specification
- Determine the running time for a Turing Machine in terms of input x and input lengths
- Understand what L(M) is
- Determine if a language L is in P
- Determine if a language L is in NP by giving a polytime guess and check algorithm OR by writing L={x:exists y....} and proving apropriate things about y and R
- Understand the concept of polytime reducability and know how to show that one problem is polytime reducable to another
-
- Friday 3 March 2000:
- Notes showing that Clique is NP-Complete are on the page
- To prepare for the next test (which takes place in the second hour of your tutorial), please be able to answer questions 1-7 on the latest problem set. Some solutions will be posted earlier. If you don't work on these yourself, you wont develop the ability to solve this type of problem.
- Thursday 29 February 2000:
- Test 1 solutions and marking scheme are now available on this web page. If you have concerns about the way your test was marked, then please
1) Understand the solution
2) Write down your concern
3) Submit it along with your original work to either instructor
for re-evaluation.
Note: if you are wrong twice, there is a possibility that additional marks will be deducted.
- Tuesday 28 February 2000:
- Marks are now posted here. No adjustment for the diffferences between the tests etc. will be
made until the end of term (if such adjustment is necessary).
- Monday 27 February 2000:
- Professor Pitt has office hours Tuesday 12:30-2
- Friday 25 February 2000:
- A4 is now available
- Quiz in tutorial next week (at the beginning of tutorial). All Turing Machine, P, NP etc. definitions
- Some more notes have been added to this page (Reducability, NP).
- Thursday 17 February 2000:
- You can find problem set 3 solutions linked to this web page
- Ioannis tutorial will not be held today, if you are in his tutorial (WB242) please go to either GB404 or WB342. This is for this week only!!
- Thursday 17 February 2000:
- Friday 11 February 2000:
- The turing Machines handout is available on my door and on this page
- We will keep the marking scheme as it was originally outlined.
- Test 3 will again take place during class time (in the new large rooms).
I hear that some of you have a midterm on Tuesday evening (Feb 22). Good luck. This means that you should make sure to attend the tutorials that week.
- Tuesday 8 February 2000:
- Problem set 3 is now on this web page
- There will still be a 10 minute quiz at the end of thursdays/fridays lecture. For the remainder of
the term, quizzes will take place in tutorial.
- Please go to your originally assigned tutorial room.
- Monday 7 February 2000:
- There will be no office hours this morning.
- You will still have tests though, these take place in the last hour of tutorial.
- Tutorials for the remainder of the term will be held in the assigned tutorial rooms.
- Your next problem set will be available later today. It is definitely good practise for the upcomming test.
- Tuesday 2 February 2000:
Partial solutions to assignment 2 can now be found in the problem sets section of this page.
Tutorials/Office Hours today will be held in MB128 (3-4) the large mining building room we used last week.
- Friday 28 January 2000:
The ALL-PAIRS-CHEAPEST-PATH handout can now be found in the lectures and tutorials section of this page.
Note that there was a typo in the implementation of the algorithm on an earlier version.
- Wednesday 26 January 2000:
Tutorials/Office Hours
Tutorials/Office Hours today will be held in MB128 the large mining building room we used last week.
Yesterday I presented a complete dynamic programming solution to a problem.
To be fair, I will probably do the same today.
If the TA strike continues, I will book this room for the remainder of the term.
- Monday 24 January 2000:
Quizzes
The quiz for L0101 will be on Friday in class (in the new room).
The quiz for L0102 will be on Thursday in class (in their new room).
Tutorials/Office Hours
Tutorials/Office Hours will be held Tuesday 5-6 (GB 405) and Wednesday 3-4 (GB 404).
I will address questions.
The dynamic programming handout is available under the lectures and tutorials section of this page below.
I have some extra copies on my door as well.
Problem set 2 is available under the problem sets section of this page below.
I have some extra copies on my door as well.
- Tuesday 18 January 2000:
Course dates and times
Please check the course date and times, these have changed.
The L0101 Friday lecture has moved to MC102 (same time 1-2).
The L0102 Thursday lecture has moved to WB116 (same time 11-12).
Tests
The first test for L0101 will be on Friday in class (in the new room).
The first test for L0102 will be on Thursday in class (in their new room).
Tutorials
Tutorials will be held Tuesday 5-7 (GB 405) and Wednesday 3-5 (GB 404).
kruskalMST handout is available under the lectures and tutorials section of this page below.
- Wednesday 12 January 2000:
Please have a look at my updated "policy on question-asking" below.
- Tuesday 11 January 2000:
There will be NO lecture for section L0102 on Thursday
13 January.
About tutorials: we (the instructors) will be
giving tutorials until further notice. Prof. Rosenbloom will be
covering tutorials on Tuesdays, 5pm-6pm, in room GB 405, and I will
be covering tutorials on Wednesdays, 3pm-4pm, in room GB 404.
- Saturday 8 January 2000:
As of 3:00pm on Friday 7 January 2000, all TA's are on
strike!
Please do NOT send us e-mail asking us "what will happen next": we
will not answer such e-mails because we have not decided yet.
Instead, keep watching this webpage for further announcements: as
soon as we have made a decision, it will be posted to this
webpage.
Irrespective of what happens to tutorials, lectures will
go on as usual.
- Wednesday 5 January 2000:
There will be a lecture for section L0102 on
Thursday.
- Monday 3 January 2000:
There is NO tutorial this week! Tutorials will
start next week, as scheduled.
Due to a miscommunication between ECE and DCS, the timetable given
under the "course information" link below was previously incorrect.
This has now been corrected. Also, the quiz and test dates have
been posted under the "important dates" link below.
Back to the course webpage.
Last updated at 11:35:06 on Saturday 8 January 2000
by François Pitt
<fpitt@cdf.utoronto.ca>