CS 155: Introduction to the Design and Analysis of Algorithms
San Jose State University
Algorithm design techniques: dynamic programming, greedy algorithms, Euclidean and extended Euclidean algorithms, Discrete and Fast Fourier transforms. Analysis of algorithms, intractable problems and NP-completeness. Additional topics selected from: selection algorithms and adversary arguments, approximation algorithms, parallel algorithms, and randomized algorithms. Prerequisite: CS 146 (with a grade of "C-" or better); Allowed Majors: Computer Science, Data Science, Computer Science and Linguistics, Applied and Computational Mathematics or Software Engineering; or instructor consent.
Average GPA: 3.03
Grade distribution records: 233 students across 10 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A+ | 23 | 9.9% |
| A | 69 | 29.6% |
| A- | 21 | 9.0% |
| B+ | 10 | 4.3% |
| B | 25 | 10.7% |
| B- | 17 | 7.3% |
| C+ | 11 | 4.7% |
| C | 18 | 7.7% |
| C- | 18 | 7.7% |
| D+ | 4 | 1.7% |
| D | 7 | 3.0% |
| D- | 3 | 1.3% |
| F | 7 | 3.0% |
Based on 233 student grade records across 10 terms and 5 professors.
Instructors
- David S Taylor 128 students, Average GPA 2.60
- Peter Christopher Mcglaughlin 45 students, Average GPA 3.28
- Yongwhan Lim 26 students, Average GPA 4.00
- Chung-Wen A Tsao 23 students, Average GPA 3.48
- Benjamin Clay Reed 11 students, Average GPA 3.75