Algorithms
Lecture, three hours; discussion, one hour. Requisite: course 3C or 32A, and 61. Not open for credit to students with credit for Computer Science 180. Graphs, greedy algorithms, divide and conquer algorithms, dynamic programming, network flow. Emphasis on designing efficient algorithms useful in diverse areas such as bioinformatics and allocation of resources. P/NP or letter grading.
Review Summary
- Clarity
-
8.3 / 10
- Organization
-
8.3 / 10
- Time
-
10-15 hrs/week
- Overall
-
5.0 / 10
Reviews
The class itself was quite interesting and relevant particularly if you are interviewing/recruiting for software engineering / tech-adjacent roles, and the class notes were well organized and clear. The instructor basically just read off the notes however, so you could learn the same material and succeed in this course by reading just the notes. The exams are very fair in difficulty and are in fact open-notes, and overall this class was worth the elective credit.
Showing 1 review
Course
Grading Information
-
No group projects
-
Attendance not required
-
1 midterm
-
Finals week final
-
100% recommend the textbook
Previous Grades
Grade distributions not available.