Course Listings » Fall 2022 » CPSC 413 - Design and Analysis of Algorithms I - Fall 2022

CPSC 413 - Design and Analysis of Algorithms I - Fall 2022

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.

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 09:30 - 10:45	ST 141	Peter Hoyer
	TUT 1	MW 15:00 - 15:50	SS 209
	TUT 2	TR 11:00 - 11:50	SS 209
	TUT 3	TR 14:00 - 14:50	SS 209
	TUT 4	MW 17:00 - 17:50	ENG 201
	TUT 5	MW 11:00 - 11:50	ENG 201
	TUT 6	MW 10:00 - 10:50	SS 209

This course will be offered next in Winter 2023.

Powered by UNITIS. More features.