CS 103 - Discrete Structures Course

Announcements 

• رجاء التمرين على المسائل الموجوده في السلايدز اكثر من مرة، التمرين يتم باستخدام ورق وقلم وحل المسألة اكثر من مرة حتى استيعابها.

Course Objectives:

1.  Develop basic mathematical reasoning skills for understanding and constructing mathematical arguments.
2.  Learn how to analyze and solve counting problems.
3.  Become familiar with abstract discrete structures used for representing discrete objects and relationships among those objects.
4.  Learn how to specify, verify, and analyze simple algorithms

Course Description:
Introduces fundamentals mathematical reasoning concepts used for solving problems. Examples from computing and several other fields are used to illuminate the finer points of the reasoning process

Topics Covered:

1.  Formal logic
2.  Proofs
3.  Sets and combinatorics
4.  Algorithms and their complexity
5.  Induction
6.  Recursion
7.  Counting
8.  Discrete probability
9.  Relations
10.  Graphs and trees
11.  Boolean algebra
12.  Finite-state machines
13.  Turing machines

Textbooks:
1. K. Rosen, “Discrete Mathematics and Its Applications”, 6th ed., McGraw-Hill, 2011. [View Book]
2. Dossey,Otto "Discrete Mathmatics" 4th ed.[View Book]
3. اكتاب تراكيب متقطعة باللغة العربية ، عرض الكتاب

Slides: (customized version of Cinda Herin slides)

1. Lecture 1: Propositional Logic [PPT]
2. Lecture 2: Predicates[PPT]
3. Lecture 3: Introduction to Proofs[PPT]
4. Lecture 4: Proof Techniques[PPT]
5. Lecture 5: Set Theory[PPT]
6. Lecture 6: More Sets[PPT]
7. Lecture 7: Functions[PPT]
8. Lecture 8: Function Growth and Algorithm Complexity[PPT]
9. Lecture 9: Sequences and Summations[PPT]
10. Lecture 10: Mathematical Induction[PPT]
11. Lecture 11: Algorithms and Recursion[PPT]

Homework:
Homeworks are now included into the slides