Rigorous analysis of the time and space requirements of important algorithms, including worst case, average case, and amortized analysis. Techniques include order-notation, recurrence relations, information-theoretic lower bounds, adversary arguments. Analysis of the key data structures: trees, hash tables, balanced tree schemes, priority queues, Fibonacci and binomial heaps. Algorithmic paradigms such as divide and conquer, dynamic programming, union-find with path compression, augmenting paths. Selected advanced algorithms. Introduction to NP-completeness. (Formerly Computer Science 201.)
11 terms
Other grades
University of California, Santa Cruz
CSE 201 at UCSC: average GPA 3.48 across 660 students. Grade distribution by term. Rigorous analysis of the time and space requirements of important…
Average GPA: 3.48
Grade distribution records: 660 students across 11 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 62 | 9.4% |
| A | 195 | 29.5% |
| A- | 127 | 19.2% |
| B+ | 77 | 11.7% |
| B | 70 | 10.6% |
| B- | 42 | 6.4% |
| C+ | 1 | 0.2% |
| C | 22 | 3.3% |
| D | 5 | 0.8% |
| F | 10 | 1.5% |
| P | 1 | 0.2% |
| S | 30 | 4.5% |
| U | 17 | 2.6% |
Based on 660 student grade records across 11 terms and 4 professors.
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades