ICS 241: Discrete Mathematics for Computer Science II

Catalog description: Program correctness, recurrence relations and their solutions, divide and conquer relations, relations and their properties, graph theory, trees and their applications, Boolean algebra, introduction to formal languages and automata theory. Pre: 141 or consent.

Textbook(s): K. H. Rosen, Discrete Mathematics and Its Applications, 7th Edition, McGraw Hill

Instructor(s): This review site is based upon materials developed by Kyungim Baek and Kazuo Sugihara.

About this site: Go to the Modules page for a list of topics; click on any topic to see details.

Additional pages collect together all of the learning outcomes, readings (i.e. “passive” learning involving review of textbook sections, web pages, screencasts, etc.), and experiences (i.e. “active” learning, where you must actually demonstrate a capability).

To contribute feedback about this site, please use the Suggestion Box.