Discrete Mathematics for Computer Science II
- ICS 241 Course Policies & Grading
- Math & Sciences Department Policies
- ICS 141 Textbook (online)
- Class Time: Tues & Thurs 9:15 am – 10:30 am
- Class Location: Koki’o 207A
- CRN: 31793
- Prerequisites: ICS 111 and a grade of “C” or higher in ICS 141 or consent of instructor.
- Credit Hours: 3
Instructor: Lisa Miller
- Office: Koki’o 109 C
- Across the hall from the elevator.
- Office Hours:
- 10:00 am – 12:00 pm Mon & Wed
- 2:30 pm – 3:30 pm Tues & Thurs
- Or by appointment.
- Email: email@example.com
- Office Phone (808) 734-9388
- Better, unofficial STEM Program website: http://kccstem.com
- Official STEM Program website: http://stem.kapiolani.hawaii.edu/
ICS 241 is the second semester of Discrete Mathematics for Computer Science. It provides the general mathematical foundation for the understanding of computer science concepts. It is intended for Computer Science majors and others interested in learning about the mathematics for Computer Science.
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.
Note: A minimum grade of B is required in this course to transfer it to UH Manoa’s ICS program (it is the prerequisite for ICS 311 a Bachelor’s degree requirement).
Student Learning Outcomes
- Analyze issues and apply 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.
This semester we are switching to a new open-source textbook.
- This is a work in progress! The status of the text and available resources will be announced in class the first week.