ICS 241 - Discrete Mathematics for Computer Science II KCC AA/FS

Institution:

Kapiolani Community College

Subject:

Description:

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. Upon successful completion of ICS 241, the student should be able to: Use boolean algebra to realize logic circuits. Use graphs, paths, cycles and trees Solve simple recurrence relations Explain the concept of formal languages and finite-state machines Use concepts and techniques in program correctness to perform simple program validation.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

kapiolani.hawaii.edu/page/home

Phone Number:

(808) 734-9000

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.