CM 339 AlgorithmsComputational Mathematics (2009-2010)
The study of efficient algorithms and effective algorithm design techniques. Program design with emphasis on pragmatic and mathematical aspects of program efficiency. Topics include divide and conquer algorithms, recurrences, greedy algorithms, dynamic programming, graph search and backtrack, problems without algorithms, NP-completeness and its implications.
Prerequisites: CS 240 and (CS 245 or SE 112) and MATH 239 or 249; Computational Mathematics students only.
Antirequisites: SE 240, SYDE 423
Notes: Enrolment is restricted; see Note 1 above. Lab is not scheduled and students are expected to find time in open hours to complete their work. Offered: F,W,S
(Cross-listed with CS 341)
(Cross-listed with CS 341)
Sections For Fall 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Burkowski, Forbes | 10:00-11:20 M T W Th F | 1/15 | 1 | 1 | MC 4045 | 5219 | ||
| Held With: CS 341 | ||||||||
Sections For Spring 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Li, Ming | 01:00-02:20 M T W Th F | 1/20 | 1 | 1 | MC 2035 | 3347 | ||
| Held With: CS 341 | ||||||||