Analyze discrete structures, including existence, enumeration, and optimization. Permutations and combinations, combinatorial identities, the inclusion-exclusion principle, recurrence relations, Polya counting. Basic definitions and properties of graphs, Eulerian and Hamiltonian graphs, trees, graph colorings and chromatic number, planar graphs.
8 terms
California State University, Fullerton
MATH 471 at CSUF: average GPA 2.64 across 240 students. Grade distribution by term. Analyze discrete structures, including existence, enumeration, and…
Average GPA: 2.64
Grade distribution records: 240 students across 8 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 5 | 2.1% |
| A | 33 | 13.8% |
| A- | 13 | 5.4% |
| B+ | 13 | 5.4% |
| B | 56 | 23.3% |
| B- | 18 | 7.5% |
| C+ | 14 | 5.8% |
| C | 61 | 25.4% |
| D+ | 3 | 1.3% |
| D | 14 | 5.8% |
| D- | 2 | 0.8% |
| F | 8 | 3.3% |
Based on 240 student grade records across 8 terms and 3 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