Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit hours: 7/week

Prerequisite Engineering Probability & Statistics Data structure

Goals of the course The course is an introductory course in discrete mathematic with emphasis on how this theory can be invoked to develop efficient algorithms and systems. Also, it serves as the mathematical perquisite for many advanced courses (design & analysis of algorithms).

OUTCOMES Students will be able to: –discuss and use set theoretic techniques, (operations, Venn diagrams, etc.). –solve problems in combinatorics (permutations, combinations, etc..). –perform various operations with relations and functions (congruence, methods of proof, induction, recursion, etc..). –explain and use the concepts of graphs and trees.

Recommended textbooks Scheinerman, Edward, Mathematics: A Discrete Introduction, 2006, Cengage. Roman, Steven. An Introduction to Discrete Mathematics, 2nd edition, Saunders, NY. Rosen, Kenneth h. Discrete Mathematics and Its Applications, 2 ed, McGraw/Hill Dossey, John A. et al, Discrete Mathematics, 3rd edition, Addison- Wesley, Reading, MA.

Course content Foundations: Sets, Sequences, and Functions Logic: propositional logic, equivalences, predicate logic; mathematical reasoning: rules of inference, methods of proving. Relations Induction and Recursion Counting Graphs and Trees Recursion, Trees, and Algorithms Boolean Algebra

Grading Home work: 30 points 3 Quizes: 30 points Exam: 40 points

Notes for communication Your header must start with [CSC278] Send your to address. Please write your name and your ID at the end of the