COMPSCI 717 - Fundamentals of Algorithmics
Faculty
Science
Department
Computer Science
Points:
30
Available Semesters:
{}
Course Components
Labs
Tutorials
Lectures
Exam
TBLs
Workshops
Description: Fundamental techniques are covered for the design of algorithms such as greedy algorithms, divide-and-conquer, and dynamic programming. Data structures are explored that help implement algorithms. Essential tools are taught for analysing algorithms, for example worst- and average-case analyses of space and time. Recommended preparation: COMPSCI 120, 130
Prerequisites / Restrictions
Restriction: COMPSCI 220, 320, SOFTENG 250, 284
Average Rating From 0 Reviews
Teaching Quality
-
Content Quality
-
Workload
-
Difficulty
-
0% - Would Recommend
0% - Would Not Recommend
Reviews