University of Calgary
CPSC 413 - Design and Analysis of Algorithms I - Winter 2024
Techniques for the analysis of algorithms, including counting, summation, recurrences, and asymptotic relations; techniques for the design of efficient algorithms, including greedy methods, divide and conquer, and dynamic programming; examples of their application; an introduction to tractable and intractable problems.
This course may not be repeated for credit.
This course may not be repeated for credit.
Hours
- H(3-2T)
Notes
- Students who have credit for Computer Science 319 instead of Computer Science 331 should contact the department for instructions on how to enrol in this course.
Prerequisite(s)
- Computer Science 331; and 313 or 351; and Mathematics 211 or 213; and 3 units from Mathematics 249, 265 or 275.
Sections
LEC 1 TR 12:30 - 13:45 Janet Leahy TUT 1 TR 11:00 - 11:50 TUT 2 WF 12:00 - 12:50 TUT 3 MW 16:00 - 16:50 TUT 4 TR 16:00 - 16:50 TUT 5 MW 15:00 - 15:50
Powered by UNITIS. More features.