My Google Scholar My Research Gate My  Faceboo profile My LinkedIn profile My Twitter profile My Slideshare profile My Youtube profile orcid

Mustafa Jarrar
Full Professor
Computer Science, Birzeit University
Discrete Mathematics
The goal of this course is to introduce students to ideas and techniques from discrete mathematics that are widely used in computer science. Ultimately, students are expected to understand and use (abstract) discrete structures that are the backbones of computer science. In particular, this class is meant to introduce logic, proofs, sets, functions, relations, counting, graphs and trees and with an emphasis on applications in computer science.

Course Outline

Chapter 2: propositional logic
2.1 Logical Form and Logical Equivalence (Slides)
2.2 Conditional Statements (Slides)
2.3 Inferencing in Propositional Logic (Slides)

Chapter 3: First Order logic
3.3 Statements with Multiple Quantifiers (Slides)

Chapter 4: Number Theory
Chapter 5: Sequences and Mathematical Induction
Chapter 6: Set Theory
Chapter 7: Functions
Chapter 8: Relations
Chapter 9: Counting
Chapter 10: Graphs and Trees
10.1 Graphs (Slides)
10.2 Graphs and Trees (Slides)

Susanna S. Epp: Discrete Mathematics with Applications (4rd Edition) . Brooks/Cole
*Participation includes class attendance, contributions during lectures, and answering questions.