CMPE 201

Course Code & Number

CMPE 201

Course Title

Discrete Structures of Mathematics

Level

BS

Credit Hours/ ECTS Credits

(3+0+0) 3 TEDU Credits, 6 ECTS Credits

Year of Study:

Sophomore

Semester:

Fall

Type of Course:

Compulsory

Mode of Delivery:

Face-to-face

Language of Instruction:

English

Pre-requisite / Co-requisite::

Catalog Description

Logic. Theorems and proofs. Set theory. Algorithms and Complexity. Number Theory. Relations. Functions. Mathematical induction. Rules of counting. Permutation and combination. Pigeonhole principle. Discrete probability. Graphs and trees. Boolean Algebra. Theory of Computation.

Course Objectives

The objective of this course is to provide an understanding of the fundamental mathematical structures of computer science, describe common proof techniques and establish a background for future theory courses.

Course Learning Outcomes

Upon succesful completion of this course, a student will be able to
1. Identify the logical statements and argumentation in regular languages
2. Understand and use common mathematical notation
3. Express and analyze a problem using set theory constructs
4. Use basic mathematical proof techniques for proving theorems
5. Count entities using rules of counting, combination and permutation
6. Compute the probability of simple and complex events
7. Identify different types of graphs and trees
8. Identify and use different types of relations and functions and their properties
9. Use the pigeonhole principle to solve mathematical problems
10. Use binomial coefficients to solve problems