ICS 241: Discrete Mathematics for Computer Science II

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. FS


Course Learning Outcomes

Program Learning Outcomes

Prerequisites: 141 or consent.

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

Grading: 10% in-class exercises 90% midterms and final.