Difference between revisions of "MA/CSSE473 - Design and Analysis of Algorithms"
| (4 intermediate revisions by one other user not shown) | |||
| 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 | ||
| | |Optional | ||
|- | |- | ||
|Homework | |Homework | ||
| Line 16: | Line 16: | ||
|- | |- | ||
|Final Project | |Final Project | ||
| | |No | ||
|- | |- | ||
|Flipped Classroom | |Flipped Classroom | ||
| Line 24: | Line 24: | ||
== Advice for Students Taking MA/CSSE473 == | == 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. | 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. | |||
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. If you tend to struggle in math-heavy courses, review your notes from CSSE230 on recurrence relations and big-O notation so that you're comfortable in the early parts of the quarter. | |||
==== Content ==== | ==== Content ==== | ||
| Line 30: | Line 31: | ||
==== Homework ==== | ==== 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. | Homework assignments tend to be relatively straightforward - just apply the concepts from class and make sure you ask questions ahead of time if a problem looks particularly difficult. Langley generally is willing to give away most of the solution as long as someone asks during class. | ||
Latest revision as of 01:41, 4 March 2024
Class Description[edit | edit source]
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 | Optional |
| Homework | Semiweekly |
| Exams | 3 |
| Final Exam | Yes |
| Final Project | No |
| Flipped Classroom | No |
Advice for Students Taking MA/CSSE473[edit | edit source]
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. If you tend to struggle in math-heavy courses, review your notes from CSSE230 on recurrence relations and big-O notation so that you're comfortable in the early parts of the quarter.
Content[edit | edit source]
Prof. Langley's notes from Winter 2023/24 are linked here.
Homework[edit | edit source]
Homework assignments tend to be relatively straightforward - just apply the concepts from class and make sure you ask questions ahead of time if a problem looks particularly difficult. Langley generally is willing to give away most of the solution as long as someone asks during class.