COMP 482: ALGORITHM DESIGN
California State University, Northridge
Prerequisites: Grade of "C-" or better in COMP 282; Grade of "C-" or better in any of COMP 256/L, MATH 320, or MATH 326. The analysis of algorithms, in terms of time and space complexity for best/average/worst case execution using asymptotic notation; the application of standard algorithmic approaches, including greedy, divide and conquer, and dynamic programming, to algorithm design; and a review of classical algorithms, including sorting, searching, and graph algorithms.
Average GPA: 2.91
Grade distribution records: 1,529 students across 15 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A | 350 | 22.9% |
| A- | 140 | 9.2% |
| B+ | 140 | 9.2% |
| B | 323 | 21.1% |
| B- | 121 | 7.9% |
| C+ | 88 | 5.8% |
| C | 202 | 13.2% |
| C- | 59 | 3.9% |
| D+ | 8 | 0.5% |
| D | 53 | 3.5% |
| D- | 10 | 0.7% |
| F | 35 | 2.3% |
Based on 1,529 student grade records across 15 terms and 7 professors.
Instructors
- John J Noga 702 students, Average GPA 2.75
- Mansoureh Lord 188 students, Average GPA 2.63
- Kamran Zamanifar 152 students, Average GPA 3.06
- Maryam Jalali 135 students, Average GPA 2.93
- Dino Aaron Biel 79 students, Average GPA 3.69
- Ani Nahapetian 65 students, Average GPA 3.42
- Adam Scott Clark 36 students, Average GPA 3.36