Discrete Structures

اعلان هام

قديم: سيتم رصد الدرجات الاجمالية مباشرة على موقع الجامعة

Course Objectives:
Having successfully completed this course, the student will be able to:

• Develop basic mathematical reasoning skills for understanding and constructing mathematical arguments.
• Solve counting problems.
•  Improve knowledge with abstract discrete structures used for representing discrete objects and relationships among those objects.
• Define simple algorithms.
• Analyze, and analyze simple algorithms.
• Verify 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. Algorithm 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]

Slides:

1. Time To Complete Project [PPT] 
2. Sets [PPT] 
3. Propositional Logic I [PPT] 
4. Propositional Logic II [PPT] 
5. Proofs [PPT] 
6. Relations [PPT]
7. Functions, Algorithm and their complexity [PPT]
8. Induction and Recursion  [PPT]
9. Graphs [PPT]
10. Finite-state machines [PPT]
11. Turing machines
12. Boolean algebra
13. Discrete probability

Thanks to Dr Essam Othman for providing slides.

Slides (Customized October 2015):

1. Formal Logic [PPT] 
2. Proofs [PPT] 
3. Sets and Combinatorics [PPT] 
4. Relations [PPT] 
5. Functions, Algorithm and their complexity [PPT]
6. Induction and Recursion [PPT]
7. Graphs [PPT]
8. Finite-state machines [PPT]
9. Turing machines
10. Boolean algebra
11. Discrete probability