CSC263H1 Course Information Sheet University of Toronto- Fall 2017

Overview
• This sheet summarizes information for the course CSC263: Data Structures and Analysis, during the fall term of
2017 on the St. George campus.

Communication
• Course page: https://piazza.com/utoronto.ca/fall2017/csc263H1/home
All course materials and announcements will be posted in Piazza . Any non personal questions should be posted
there. For personal questions please email the instructor, include CSC263 in your subject line.
• Students are responsible for reading all announcements on the course website; please check at least weekly.

References
• Textbook: Introduction to Algorithms, Third Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest and Clifford Stein is available online from the University of Toronto library.
• See Piazza for additional references, lecture outlines and assignment’s handout.

Contacts
• Instructor: Fatemeh Panahi, fpanahi@cs.toronto.edu
Section Lectures Tutorials Office hours:
LEC0101, LEC2003 Wed 12:00-14:00 (BA 1190) Fri 10:00-11:00 (BA 1190) 9:00 - 10:30
LEC0201, LEC2000, LEC2201 Wed 15:00-17:00 (EM 001) Fri 13:00-14:00 (EM 001) 10:30 - 12:00

Course Mark Composition

• Assignments: 40%
Midterm Test: 20%, Oct 27, (Time TBA)
Final Exam: 40% TBA in Exam Period
Participation (Actively engaging in lectures and tutorials and answering questions in Piazza): Extra 2%
In order to pass the course, you must have a mark of at least 35% on the Final Exam

• Assignment details will be provided in separate handouts. Each Assignment must be completed in groups of two
students. You need to work together with your teammate on ALL the assignments’ questions. Our suggestion is
that one becomes responsible to write the solution and the other team member becomes responsible to read,
review and edit. Each assignment is due by 11:59pm on Fridays. The deadlines will not be extended and late
homework submissions are not accepted, except for documented unusual circumstance see the policy on special
consideration (petitions) below.
All remarking requests must be received within one week.
• For the midterm test, you will be allowed one 8.5” 11” aid sheet, handwritten on one side.
For the final exam, you will be allowed one 8.5” 11” aid sheet, handwritten on both sides.

Schedule
Week Date Event Weight Topic Notes
1 Sep 11 - Sep 15 Complexity Review; ADTs [1-4] First lecture
2 Sep 18 - Sep 22 Group formation Priority Queues; Heaps [6]
3 Sep 25 - Sep 29 Assignment 1 due 10% Dictionaries; BSTs [12.1 - 12.3]
4 Oct 2 - Oct 6 Balanced Trees;Augmenting [14]
5 Oct 9 - Oct 13 Hashing [11]
6 Oct 16 - Oct 20 Assignment 2 due 10% Randomization; Quicksort [5, 7]
7 Oct 23 - Oct 27 Midterm on Oct 27 Amortization; Dynamic Arrays [17]
8 Oct 30 - Nov 3 Graphs; Breadth-First Search [22]
Nov 6 - Nov 10 – No lecture – Reading week
9 Nov 13 - Nov 17 Assignment 3 due 10% Depth-First Search [22]
10 Nov 20 - Nov 24 Disjoint Sets [21]
11 Nov 27 - Dec 1 Minimum Spanning Trees [23]
12 Dec 4 - Dec 8 Assignment 4 due 10% Lower Bounds [8.1, 9.1] Last lecture
Dec 9 - Dec 20 Final Exam 40%
 By the end of this course, students will be familiar with a variety of standard, complex data structures and abstract
data types (graphs, dictionaries, balanced search trees, hash tables, heaps, disjoint sets), and with standard complexity
measures (worst-case, average-case, amortized). More specifically, students will be able to:
• recognize algorithms that employ each data structure,
• write algorithms that employ each data structure,

• recognize when each complexity measure is most appropriate,

• analyze the efficiency of algorithms using each complexity measure,
• choose and/or modify data structures appropriately to solve various problems.

Assignment submissions
• All assignment handouts will be posted in Piazza and the solutions must be submitted to Markus. The Markus
link will be posted in Piazza and will be announced.

Petitions
• If you are unable to complete homework or if you miss a test due to major illness or other circumstances completely
outside of your control, please contact your instructor immediately. Special consideration will be considered
on an individual basis and will not be given automatically. In other words, you risk getting a mark of zero for
missed work unless you contact your instructor promptly.
In the case of illness, medical documentation must be supplied on the official University of Toronto Verification of
Illness or Injury Form (see the course website for a link to this document). If you have any concerns or questions
regarding your situation, please contact your instructor or your College. Registrar they are well-equipped to help
you with anything you may be going through.

Policy Regarding Plagiarism and Academic Offense

• Students on a team will get the same mark for the assignments unless they both request a different division of
marks in writing. All team members are expected to contribute a significant effort to the course project.
Everything that you submit for marks (assignments, test and exam) must not contain anyone else’s work or
ideas without proper attribution. In particular, your assignment must be done in isolation of other students,
notes or other sources. You must prepare the written solutions only with your teammate. This ensures that your
work is truly your own, and that your grade reflects your own understanding of the course material. Copying
assignments and allowing other groups to copy your assignment are strictly forbidden. University of Toronto
has strict rules against plagiarism.

Remark request policy (for assignments/test)

• You can ask for remarking if you believe there is a mistake in the marking. If your request concerns a simple
addition error or similar kind of errors, see the instructor.
You should submit your remark request at most one week (7 days) after the solutions are posted. Remark requests
after this date will not be accepted. We will look at all remark request, however, please try to submit a remark
request only when you believe the remarking will result in a significant increase your mark, e.g. please don’t
submit a remark request if the total increase that can result from your remark request is less than 1% of your final
grade.
Reminder: A remarking request can cause the overall mark to stay the same, increase or decrease: we may
re-examine every question in the paper and if new mistakes are found they can also change the marking up or
down accordingly. Please submit a remarking request only if: (a) you have read and completely understood our
posted solution set, and (b) you still think that your solution is correct and was mistakenly marked as incorrect.
We rarely if ever accept remarking requests of the type “yes, my solution is not correct, but I think you took off
too many marks for this mistake”: The marking scheme was decided and applied as uniformly as possible to all
students. If you believe a marking scheme is too harsh, it is still fair as long as it is consistently applied, we will
adjust the marks (by adding points to everyone) if the marks are unexpectedly low because of marking scheme
being harsh.