University of Kentucky
Department of Computer Science
CS 275 Discrete Mathematics
1. Course Number/Name: CS 275, Discrete Mathematics
2. Credits and Contact Hours: 4 credits, 4 contact hours
3. Instructor: assigned by the department
4. Textbook: Discrete Mathematics and Its Applications (any edition), K. H. Rosen, McGraw Hill (recommended).
5. a. Catalog Description: Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions, Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees.
b. Prerequisites: MA 113 and either EGR 102 or CS 115
c. Required course: Required
6. a. Outcomes of Instruction: Students will demonstrate knowledge of a variety of mathematical tools applicable in computer
science.
Specifically, students will be able to:
1. construct inductive proofs;
2. apply set algebra;
3. apply elementary logic;
4. enumerate combinatorial objects;
5. solve recurrence relations.
b. Contributions to Student Outcomes (ABET Criterion 3 for Computer Science)
|
Outcome
|
a
|
b
|
c
|
d
|
e
|
f
|
g
|
h
|
i
|
j
|
k
|
|
CS 275
|
3
|
|
|
|
|
|
|
|
|
3
|
|
3- Strongly supported 2 – Supported 1 – Minimally supported
7. List of Topics Covered:
1. Basic Proofs
2. Functions, Sequences and Series
3. Induction and Recursion
4. Counting Techniques
5. Relations
6. Introduction to Graphs and Trees