Difference between revisions of "MA/CSSE473 - Design and Analysis of Algorithms"
| Line 1: | Line 1: | ||
== Class Description == | == Class Description == | ||
Design and Analysis of Algorithms is typically taken during junior or senior year. It covers techniques for designing algorithms and for analyzing the time and space efficiency of different algorithms. Many of the algorithms covered during the course will be familiar to those who do leetcode, if you don't, now is a good time to start. | |||
{| class="wikitable" | {| class="wikitable" | ||
|Reading | |Reading | ||
Revision as of 14:18, 3 March 2024
Class Description
Design and Analysis of Algorithms is typically taken during junior or senior year. It covers techniques for designing algorithms and for analyzing the time and space efficiency of different algorithms. Many of the algorithms covered during the course will be familiar to those who do leetcode, if you don't, now is a good time to start.
| Reading | None |
| Homework | Semiweekly |
| Exams | 3 |
| Final Exam | Yes |
| Final Project | [No] |
| Flipped Classroom | No |
Advice for Students Taking MA/CSSE473
Langley is fantastic, Eldredge has been noted as another good professor. By the time most students will be taking this class, they should know how to find good professors anyway. The proofs in comparison to other CS/MA courses are very simplistic. As long as you're comfortable with the math from CSSE230 and MA376, this is a fairly easy class.
Content
Prof. Langley's notes from Winter 2023/24 are linked here.
Homework
Homework assignments tend to be relatively straightforward - just apply the concepts from class and ask questions ahead of time if a problem looks particularly difficult.