Implementations of advanced tree structures, priority queues, heaps, directed and undirected graphs. Advanced searching and sorting techniques (radix sort, heapsort, mergesort, and quicksort). Design and analysis of data structures and algorithms. Divide-and-conquer, greedy, and dynamic programming algorithm design techniques. Prerequisite(s): MATH 30, MATH 42, CS 46B, and [(CS 48 or CS 49J) if CS 46B was not in Java], each with a grade of C- or better; Computer Science, Applied and Computational Math, Forensic Science: Digital Evidence, Software Engineering, Data Science, Computer Science and Linguistics majors only; or instructor consent.
17 terms
San Jose State University
CS 146 at SJSU: average GPA 2.66 across 4,383 students. Grade distribution by term. Implementations of advanced tree structures, priority queues, heaps…
Average GPA: 2.66
Grade distribution records: 4,383 students across 17 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 264 | 6.0% |
| A | 600 | 13.7% |
| A- | 321 | 7.3% |
| B+ | 388 | 8.9% |
| B | 757 | 17.3% |
| B- | 401 | 9.1% |
| C+ | 313 | 7.1% |
| C | 496 | 11.3% |
| C- | 219 | 5.0% |
| D+ | 99 | 2.3% |
| D | 149 | 3.4% |
| D- | 55 | 1.3% |
| F | 321 | 7.3% |
Based on 4,383 student grade records across 17 terms and 21 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