Winter 2004, Schedule: MWF 13:30-14:30; BURN 1B45
Instructor:
Prof. Claude Crépeau
Send comments to
crepeau@cs.mcgill.ca
avoid sending me HomeWork questions directly; uses links below for faster replies...
Office Hours: Thursday 13:30-16:00, McConnell 302, 398-4716
EXTRA OFFICE HOURS, Wednesday April 14th, 11:00-15:00
TAs:
Danielle MacNevin, John Mark Mercer, Andrew Royes.
T.A.'s Office Hours:
Danielle, McConnell 337, Monday 10:00-11:30
John, McConnell 106, Friday 14:30-16:00
Andrew, Trottier 3107, Wednesday 14:30-16:00
FOR ALL CLASS MATTERS CONTACT
cs250@cs.mcgill.ca
or
WebCT disucssion group
Homework 4: HiQ.java for HiQ class
Homework 4: HiQL.java for HiQL class
Homework 5 oversimplified FindCenter algorithm !!!
Homework 5: explaination of algorithm UPDATED version, 31 March 2004.
Note: if you have questions, DO NOT e-mail msurder@cs.mcgill.ca (as suggested in the document) but cs250@cs.mcgill.ca as usual.Homework 5: Integer Comparaison wrapper methods.
Homework 5: Generic Quicksort method.
Lectures 6 Java Methods (by John Mark Mercer)
Lecture 13: EXTRA examples of big-O notations
Lectures 17 (bogus algorithms)
Lectures 17 (fixed algorithms)
JAVA implementation complement to Lecture 23
JAVA implementation complement to Lecture 23
Lecture 25 Graphs Data Structure
Lecture 26-27 Trees, Traversals and Binary Trees
Lecture 27 Binary Search Trees
Lectures 30-31 Computational Geometry & simple closed path
Lectures 33-34 String Matching and Regular Expressions
Lecture 33 String Matching fixed KMP failure function (P. 18)
Lectures 34-35 Regular Expressions / Finite State Automata
Lectures 36-37 Computability / Complexity
A SAMPLE FINAL EXAM (based on the actual one Y2K)
Description: (3 credits; 3 hours: Prerequisites:
Familiarity with a high level programming language and CEGEP level mathematics.)
An introduction to the design of computer
algorithms, including basic data structures, analysis of
algorithms, establishing correctness of programs and program testing.
Overview of topics in Computer Science.
NOTE: COMP 203 and COMP 250 are considered to be equivalent from a prerequisite
point of view, and may not both be taken for credit. Computer Science
Major and Honours students are strongly advised to
take COMP 250 instead of COMP 203. They are also advised to take MATH 240
simultaneously with COMP 250 (or with COMP 202 or -203, and before
COMP 251).
Send comments/questions to crepeau@cs.mcgill.ca
04/04/04