Homepage for CSC 378, Fall 2002

Data Structures and Algorithm Analysis

University of Toronto at Mississauga

ANNOUNCEMENTS:
  • Term marks and tentative final grades.

    Handouts:

  • Course information sheet --- in Postscript and Adobe PDF.
  • Review of time complexity and asymptotic bound notation --- in Postscript and Adobe PDF.
  • AVL trees --- in Postscript and Adobe PDF.
  • Breadth First Search --- in Postscript and Adobe PDF.
  • Minimal Spanning Trees --- in Postscript and Adobe PDF.

    Course news group:

  • Read the newsgroup.
  • Post a message to the newsgroup.

    Web page for the St George section of 378.

    FINAL EXAM at Erindale:

  • NO AIDS will be allowed.
  • In particular, NO CHEAT SHEETS will be allowed.
  • Be sure you understand the solutions to all the assignments.
  • The exam will cover the entire course, focussing on the following topics: Heaps, binomial heaps, binary search trees, AVL trees, augmented data structures, probability, asymptotic complexity, (ie, big O, big Theta and big Omega notation), disjoint sets (its various implementations and heuristics), hashing, amortized analysis, dynamic tables, graphs and graph algorithms (BFS, DFS, MST),

    MIDTERM:

  • As unanimously requested by the class, the midterm date has been moved forward.
  • The new date is WEDNESDAY OCTOBER 23 IN CLASS starting at 2:10pm sharp!
  • 50 minutes.
  • Closed book.
  • To be followed by a lecture.
  • The midterm will include everything covered in class up to and including hashing, randomized algorithms, and average-case analysis. Quicksort itself will not be on the exam.

    HOMEWORK COLLABORATION POLICY:

  • In each homework you may collaborate with at most one other student who is currently taking the Erindale section of CSC 378. If you collaborate with another student on a homework, you and your partner must submit only one copy of your solution, with both of your names on the cover. The solution will be graded in the usual way and both partners will receive the same mark. Collaboration involving more than two students is not allowed.
  • For help with your homework you may consult only the instructor, TAs, your homework partner (if you have one), your textbook and your class notes. You may not consult any other source.

    ASSIGNMENT 1:

  • Due Weds October 2 at noon in the 378 drop box.
  • Late assignemtsn will not be accepted.
  • Questions --- in PostScript and Adobe PDF.
  • Solutions --- in PostScript and Adobe PDF.

    ASSIGNMENT 2:

  • Due Wednesday October 16, 2:05pm in class, before class begins.
  • Late assignments will not be accepted.
  • Questions --- in PostScript and Adobe PDF.
  • Solutions --- in PostScript and Adobe PDF.

    ASSIGNMENT 3:

  • Due Wednesday October 30, 2:05pm in class, before class begins.
  • Late assignments will not be accepted.
  • Questions --- in PostScript and Adobe PDF.
  • Solutions --- in PostScript and Adobe PDF.

    ASSIGNMENT 4:

  • Questions --- in PostScript and Adobe PDF.
  • Solutions --- in PostScript and Adobe PDF.

    ASSIGNMENT 5:

  • Questions --- in PostScript and Adobe PDF.
  • Solutions --- in PostScript and Adobe PDF.