Discrete Mathematics 
DIS MATH 
CLASS CODE: 
CS 236 
CREDITS:
4

DIVISION: 
PHYSICAL SCIENCE & ENGINEERING 
DEPARTMENT: 
ELECTRICAL & COMPUTER ENGINEERING 
GENERAL EDUCATION: 
This course does not fulfill a General Education requirement. 

CATALOG DESCRIPTION: 
Discrete mathematics for Computer Science and Computer Engineering. Introduces the mathematical topics needed to provide a solid foundation for further courses. 
DESCRIPTION: 

TOPICS: 
Functions, Sets, and Relations; Basic Logic; Proof Techniques; Basics of Counting; Discrete Probability; Number Theory Topics. 
OBJECTIVES: 
Illustrate by examples the basic terminology and operations of functions, relations, sets. Manipulate formal methods of symbolic propositional and predicate logic. Demonstrate knowledge of formal logic proofs and logical reasoning through solving problems. Outline basic proofs for theorems using the techniques of proof by contradiction and mathematical induction. Relate the ideas of mathematical induction to recursion and recursively defined structures. Apply proof techniques to solve problems in other areas of computer science. Compute permutations and combinations of a set, and interpret the meaning in the context of the particular application. Solve recurrence relations. Calculate probabilities of events and expectations of random variables for problems arising from games of chance. Demonstrate how to apply the tools of probability to CSrelated problems. Solve problems in areas of elementary number theory. 
REQUIREMENTS: 
Class attendance is required but is not necessarily part of the grade. Each student is required to read assigned portions of the textbook(s). 
PREREQUISITES: 
CS 165 and Math 112 
OTHER: 

EFFECTIVE DATE: 
August 2003 