CIS 167 - Discrete Structures
Credit Hours: 4
Billable Contact Hours: 4
Prerequisites: MATH 159 or MATH 164 or MATH 171 ;
Corequisite: CIS 250 must be successfully completed prior to or concurrently
Session Cycle: WI
This course covers mathematical principles and techniques required for analysis, proofs and general understanding of algorithms used in computer science. Topics include: algorithms, advanced counting, sets, Boolean algebra, graphs, trees, functions, mathematical induction and understanding and doing proofs.
Notes:
Business Division
Theory Hours: 60
Learning Outcomes:
1. Create a complete functioning program that solves a problem.
Applies To Computer Information Systems: Computer Science, A.A.S. Program Outcome A
2. Describe the advantages of using object oriented programming for program development.
Applies To Computer Information Systems: Computer Science, A.A.S. Program Outcome B
3. Demonstrate some of the methods used to secure data and communications.
Applies To Computer Information Systems: Computer Science, A.A.S. Program Outcome C
|
