Course Abstract Details

ENCE-250, Discrete Structures

Credits: 4

Course Description

ENCE-250, 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. Prerequisite: MATH-136 and CIS-132, both with a grade of "C" or better, or permission of the program adviser. Four hours lecture each week. Four credits. Four billable hours. Offered Fall term only.

Course Objectives and Grading Information

MAJOR COURSE OBJECTIVES: Upon completing this course the student should be able to:

1. Explain logic statements (GE 1,2,3,5 PG 1)

2. Use elementary number theory (GE 1,2,3,5 PG 1)

3. Solve problems involving summations, recurrences, and mathematical induction (GE 1,2,3,5 PG 1)

4. Define set theory (GE 1,2,3,5 PG 1)

5. Understand counting (GE 1,2,3,5 PG 1)

6. Create functions that use recursion (GE 1,2,3,5 PG 1)

7. Describe relations (GE 1,2,3,5 PG 1)

8. Understand graph theory (GE 1,2,3,5 PG 1)

Epp, S. Discrete Mathematics with Applications, 3rd edition. Brooks/Cole-Thomas Learning, 2004. [ISBN-13: 978-0-53-435945-4]

Learning Goals

The abbreviations in parentheses represent Learning Goals which have been identified for this course and program of study:

Bookmark, Share, or Email this page Get Help