CSCC73H3 Lecture : Course Information
19 Oct 2011
School
Department
Course
Professor
Document Summary
O ce hours: mon 3 4, or by appointment. Tutorials: fri 10 11 (bv 516) and fri 11 12 (aa 206) Course goals: to introduce the main algorithmic paradigms (greedy, divide-and-conquer, dynamic programming, and linear programming) through concrete examples. Emphasis on abstract thinking and problem-solving, not on programming. Textbook: kleinberg and tardos, algorithm design, addison wesley 2006; supplemented with dasgupta, papadim- itriou, and vazirani, algorithms, mcgraw hill 2006. Evaluation: there will be four equally-weighted homework assignments worth 40% of the course mark, a midterm exam worth 20% of the course mark, and a nal exam worth 40% of the course mark. To pass the course you must get a grade of 35% or better on your nal exam. Homework marking: for each homework assignment we may mark only a selected subset of the questions (but solutions to all problems will be made available). In that event, the homework will be marked out of the total weight of the selected questions.
