COMP 3614

Algorithms and Complexity

Lec 001 and Tut 401 selected

(3 Credits) 3 Lecture hours, 1 Tutorial hour The design of algorithms and the analysis of their efficiency. Greedy algorithms, divide-and-conquer strategies, recursive backtracking, and dynamic programming are studied. Heuristic algorithms and NP-completeness are introduced.

Sections

Lecture

Lec 001

Tue, Thu 14:30-15:50

Tue, Thu14:30-15:50Faculty of Arts Building EA200540667

Tutorial

Tut 401

Fri 8:30-9:20

Fri8:30-9:20Lincoln Park T13040668

Syllabus

Have the syllabus for COMP 3614? Share it and everyone gets the grading, textbooks and rules.