ICS 241 Discrete Mathematics for Computer Science II (3)

3 hours lecture per week

Prerequisite(s): ICS 111; ICS 141, or consent of instructor.
ICS 241 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.

Course Syllabus

Not available at this time.

I’m Dr. David Nickles, an instructor here at Kapiolani Community College. I teach the ICS 141 and 241 Discrete Math classes. Discrete math is a popular book topic, start Googling around and you’ll and a zillion di erent textbooks about it. Take a closer look, and you’ll discover that most of these are pretty thick, dense volumes packed with lots of equations and proofs. They’re principled approaches, written by mathematicians and (seemingly) to mathematicians. Your average computer science practitioner, however, might be better served by a more applications driven approach. That is what this course attempts to do. Computer science students will benefit most from simply gaining an appreciation for the richness and rigor of Discrete Mathematics, what it means, and how it impacts their discipline. Basic fluency with each topic area, and an intuition about when it can be applied, is the proper aim for most of those who would go forward and build tomorrow’s technology. I aim to be your tour guide through the garden of discrete math; I will point out the notable features of the landscape and try to instill a sense of appreciation and even awe. I look forward to seeing you in ICS 141 and 241, a 2-part course on the study of discrete math for computer science majors.