CMSC651

Analysis of Algorithms

Efficiency of algorithms, orders of magnitude, recurrence relations, lower-bound techniques, time and space resources, NP-complete problems, polynomial hierarchies, and approximation algorithms. Sorting, searching, set manipulation, graph theory, matrix multiplication, fast Fourier transform, pattern matching, and integer and polynomial arithmetic.

Spring 2026

Aravind Srinivasan

0 reviews
Average rating: N/A

Past Semesters

Aravind Srinivasan

0 reviews
Average rating: N/A

Include P/F semesters During the Spring 2020 and Spring 2021 semesters, students could choose to take some of their courses pass-fail mid-semester which skews grade data aggregated across multiple semesters.

Average GPA of 3.43 between 151 students*

A-: 12.58%

A: 22.52%

A+: 21.19%

B-: 5.3%

B: 8.61%

B+: 14.57%

C: 1.32%

C+: 1.32%

F: 0.66%

W: 3.97%

other: 7.95%

* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.