Your feedback has been sent to our team.
Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include finite and infinite sets, elementary combinatorial problems, and graph theory. Development of tools and mechanisms for reasoning about discrete problems.
2.18
2.54
3.65
—
Fall 2021
—
—
2.94
—
Fall 2021
3.25
2.50
3.81
—
Fall 2021
—
—
—
—
Summer 2021
3.70
2.67
3.78
—
Spring 2021
—
—
—
—
Fall 2020
2.83
2.50
3.45
—
Spring 2019
2.60
3.84
3.14
—
Spring 2018
—
—
—
—
Spring 2017
3.17
3.50
3.59
—
Fall 2017
—
—
—
—
Fall 2017
2.93
3.20
2.86
—
Spring 2014
—
—
—
—
Spring 2013
3.78
2.83
3.20
—
Fall 2013
2.08
4.50
2.48
—
Spring 2012
—
—
2.27
—
Fall 2009
No course sections viewed yet.
We rely on ads to keep our servers running. Please disable your ad blocker to continue using theCourseForum.