CSC 270: FUNDAMENTAL DATA STRUCTURES AND TECHNIQUES

University of Toronto, St. George Campus, Fall 1996--97

Syllabus


Instructor:  James Stewart, SF 4306D, 978-5359, jstewart@cs

                                       email      tutorial   surnames

Tutors:      Mikhail Soutchanski   at270sou@cdf   SF 1105     A - D
             Barry Weinberg        g3weinbe@cdf    GB 305     E - LEE
             Raoul Jarvis          jarvis@cs       GB 405     LEF - SIN
             Kwok Chow             chow@cs         GB 415     SIO - Z
             Kenneth Kam           g3kamdbs@cdf    marker

Tutorial:    Monday, 6:10 -- 7:00pm

Lectures:    Monday, 7:10 -- 9:00pm with a 10 minute break, held in SF 1105

Office hour: Monday, 2:00 -- 3:00pm in SF 4306D
             Also by appointment; Send me email first!


Grading

Homework (4)  50 %   A1 8%, A2 12%, A3 18%, A4 12%
Midterm test  10 %
Final exam    40 % 


Policy

- See the Web page at http://www.dgp.toronto.edu/people/JamesStewart/270.

- To pass this course you must get a grade of at least 35% on your final exam.

- Late homeworks will be penalized 20% per day or portion thereof.
  See the lateness policy on the Web page.

  If you are unable to complete homework due to major illness, talk with
  the professor BEFORE the due date.  There is no excuse for not
  contacting him: You can leave a message with the secretary (978-5359)
  or you can email him or a friend can bring the news.

  Extensions will be considered on an individual basis and will NOT be
  given automatically for illness, even with a doctor's note.  No
  sympathy is given for illness after the due date.  You will not get an
  extension if you inform the professor after the due date.

- It is legitimate to discuss homework problems with fellow students.
  You should not leave such a discussion with any written material
  provided by, or copied from, another person.  FAILURE TO COMPLY WITH
  THESE GUIDELINES IS A SERIOUS ACADEMIC OFFENCE.

- Additional material will be taught in the tutorials.  You are
  expected to know this material.


Texts

- K.N. King, ``C Programming: A Modern Approach'', W.W. Norton, 1996,
  $56.  If you already know C or already have a C book, you might want
  to wait for the first class before purchasing this text.

- CSC270 Course Notes in the bookstore, $32.

- J.N. Clarke, ``A Student's Guide to CDF'' in the bookstore, $1.


Important Dates

Monday, September 30   Assignment 1 due at 6:10pm in tutorial
Wednesday, October 16  Assignment 2 due at 5:00pm in box outside SF4306
Monday, October 21     Midterm 6:10 -- 7:00pm in tutorial rooms assigned above
Monday, November 11    Assignment 3 due at 6:10pm in tutorial
Monday, November 25    Assignment 4 due at 6:10pm in tutorial 


Other Important Dates

September 20      deadline to enroll in 270
October 14        Thanksgiving -- no class or office hours
November 1        deadline to drop 270 from academic record
December 6        classes end
December 9 -- 18  final exams


Syllabus


- Numerical Methods & C: weeks 1 -- 4

  C control constructs, data types, I/O, and functions.  Floating point
  numbers and their perils.  Finding roots and maxima/minima.  Finding
  fixed points.

- Graphs & C++: weeks 5 -- 7

  C pointers.  Object oriented programming.  C++ classes & templates.
  C++ I/O.  Graph representations. Breadth-first search.  Depth-first
  search.  Topological sort.  Maybe shortest path and transitive
  closure.

- Simulation & C++: weeks 8 -- 10

  Data structures for simulation.  Event--driven models.  Queueing.

- Optimization: weeks 11 -- 12

  Greedy algorithms.  Dynamic programming.