Course Description
The purpose of this course is to introduce the essential mathematical concepts and ideas in discrete mathematics,which are required for rigorous studies in most areas of computer science including Logic and Proof Techniques, Analysis of Algorithm, Digital Circuit, Network, Software Engineering, and Artificial Intelligence. Topics include:Propositional logic, logical equivalence, Quantifiers; Set theory, Mathematical induction; vector and matrices; Relations, Equivalence Relations, Partial Ordering Relations; Functions, Sequences, Indexed Classes of Sets, Recurrence Relations, Recursively defined functions, algorithms and complexity of algorithm; Properties of integers; Basic counting techniques, Binomial coefficients and Pascal triangle, Pigeonhole Principle; Graph theory, Tree graphs, Directed graphs; Boolean Algebra. Emphasis will be placed on providing a context for the application of discrete mathematics within computer science.
Course ID: MATH 232
| Credit hours | Theory | Practical | Laboratory | Lecture | Studio | Contact hours | Pre-requisite | 3 | 4 | 4 | STAT 238 |
|---|
