ENCE 250 - Discrete Structures

Number of Credits: 4
Discrete Structures is about the fundamental mathematical concepts related to computer science, including finite and infinite sets, relations, functions, and propositional logic. A variety of techniques for modeling and problem solving in computer science is introduced. Permutations, combinations, graphs, and trees are used in applications (Fall Term Only) Four hours lecture each week. Four Credits. Four billable hours.

Pre-requisite(s): MATH 136 and CIS 132, with minimum grades of C or better.
Course Objectives: Upon successful completion of this course, students will be able to:

Explain logic statements (GE 1,2,3,5 PG 1)
Use elementary number theory (GE 1,2,3,5 PG 1)
Solve problems involving summations, recurrences, and mathematical induction (GE 1,2,3,5 PG 1)
Define set theory (GE 1,2,3,5 PG 1)
Understand counting (GE 1,2,3,5 PG 1)
Create functions that use recursion (GE 1,2,3,5 PG 1)
Describe relations (GE 1,2,3,5 PG 1) 8. Understand graph theory (GE 1,2,3,5 PG 1)