ICS 241 : Discrete Mathematics for Computer Science II

Includes program correctness, recurrence relations and their solutions, divide and conquer relations, graph theory, trees and their applications, Boolean algebra, introduction to formal languages and automata theory.

Prerequisites

Grade of ā€œCā€ or better in ICS 141 or consent of instructor.

Course Outcomes

  • Analyze issues and apply more complex mathematical problem solving skills to plan courses of actions in high-level decision-making situations.
  • Utilize such tools as graphs, trees, boolean algebra, and recurrence relations.
  • Explain discrete math concepts such as formal languages, finite-state machines, and program correctness.

Course Details

Credits:

3

Lecture Hours:

3

Designation:

FS