ICS 141 - Discrete Mathematics for Computer Science I KCC AA/FS

Institution:
Kapiolani Community College
Subject:
Description:
3 hours lecture per week Prerequisite(s): Qualification for MATH 135 or consent of instructor. ICS 141 includes logic, sets, functions, matrices, algorithmic concepts, mathematical reasoning, recursion, counting techniques, probability theory. Upon successful completion of ICS 141, the student should be able to: Solve problems in propositional logic, work with truth tables, and use Venn diagrams. Solve problems in elementary set theory. Prove theorems using mathematical induction. Use the formulas for permutations, combinations, and binomial coefficients. Perform general analysis of algorithms.. Use recursive algorithms. Solve problems in elementary probability Solve elementary problems of relations Explain the concept of functions Solve basic matrix operations
Credits:
3.00
Credit Hours:
Prerequisites:
Corequisites:
Exclusions:
Level:
Instructional Type:
Lecture
Notes:
Additional Information:
Historical Version(s):
Institution Website:
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.

Detail Course Description Information on CollegeTransfer.Net

Copyright 2006 - 2025 AcademyOne, Inc.