Course
| code | CS202 |
| credit_hours | 3 |
| title | Discrete Structures |
| arbic title | |
| prequisites | CS111 |
| credit hours | 3 |
| Description/Outcomes | The course provides an introduction to mathematical structures fundamentals of computer science. Topics discussed include logic of compound and quantified statements, number theory and methods of proof, sequences and mathematical induction, set theory, counting methods, s and relations. The course lays down the mathematical formulation necessary for success in the computer science field. |
| arabic Description/Outcomes | |
| objectives | 1. Use logic to determine the validity of an argument.
2. Construct the proof of a theorem.
3. Understand the terminology, operations, and symbols of set theory.
4. Use combinatorial techniques when needed in solving problems.
5. Identify s specifically, surjective, injective, and bijective s.
6. Identify relations specifically, a partial order, equivalence, and total order relations. |
| arabic objectives | |
| ref. books | Judith L. Gersting, Mathematical Structures for Computer Science, W. H. Freeman Press. |
| arabic ref. books | |
| textbook | Susanna Epp, Discrete Mathematics with Applications, Thomson Learning. |
| arabic textbook | |
| objective set | |
| content set | |
| course file |
530_CS202_CS202.pdf |