CSI 3105 Design and Analysis of Algorithms I
3 units
Computer Science
Faculty of Engineering
Analysis of algorithms: worst-case analysis, complexity analysis, asymptotic notations and basic complexity classes. Algorithm design techniques: brute force, divide and conquer, dynamic programming, greedy, backtracking. Computational complexity of problems: lower bound arguments, the classes P, NP, NP-complete, dealing with NP-complete problems.
Components:
Lecture
Requirements:
Previously Offered Terms:
Fall
Summer
French Equivalent:
Organized
387 responses
4.49
/ 5
Clear Expectations
150 responses
4.19
/ 5
Learned a Lot
388 responses
4.27
/ 5
Recommend
239 responses
3.75
/ 5
Workload
239 responses
2.44
/ 5
Fair Assessments
389 responses