Mathematical modeling, design, analysis and proof techniques related to computer engineering. Probability, logic, combinatorics, set theory, and graph theory, as they pertain to the design and performance of computer engineering systems. Techniques for the design and analysis of efficient computational methods from graph theory and networks. Understanding of the limits on the efficiency of such computational methods. Translation from mathematical theory to actual programming. The course emphasizes mathematical rigor.
Average rating: 2.86
Average GPA: 3.08 between 266 students
"W"s are considered to be 0.0 quality points. "Other" grades are not factored into the average GPA calculation.