| |
Nov 18, 2024
|
|
|
|
|
COSC 3P03 - Algorithms
Design and analysis of computer algorithms. Topics include asymptotic notations, solving recurrences, order statistics, general algorithm design techniques such as divide-and-conquer, greedy algorithms, dynamic programming, backtracking and branch-and-bound. Graph and string algorithms. Introduction to NP-Completeness and complexity theory.
Course Format: Lectures, 3 hours per week.
Prerequisite(s): COSC 2P03 (minimum 60 percent).
Course Notes: This course may be offered in multiple modes of delivery. The method of delivery will be listed on the academic timetable, in the applicable term.
Add to Portfolio (opens a new window)
|
|