Jarrar: Discrete Mathematics Course


                                                            Discrete Mathematics Course

Course Outline
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, counting and relations with an emphasis on applications in computer science.

Inference Methods In Propositional Logic

By: Mustafa Jarrar

Propositional Logic: Digital Circuits

By: Mustafa Jarrar

First Order Logic

By: Mustafa Jarrar

First Order Logic Basics

By: Mustafa Jarrar

Set Theory

By: Mustafa Jarrar

Algebraic Proofs in Set Theory

By: Mustafa Jarrar

Properties of Sets

By: Mustafa Jarrar

Boolean Algebra

By: Mustafa Jarrar

Number Theory and Proof Methods

By: Mustafa Jarrar

Number Theory: Rational Numbers

By: Mustafa Jarrar

Number Theory: Divisibility

By: Mustafa Jarrar

Sequences

By: Mustafa Jarrar

Mathematical Induction I

By: Mustafa Jarrar

Mathematical Induction II

By: Mustafa Jarrar

Introduction to Functions

By: Mustafa Jarrar


One-to-One, Onto, Inverse Functions

By: Mustafa Jarrar

Application: The Pigeonhole Principle

By: Mustafa Jarrar

Counting and Probability

By: Mustafa Jarrar

Counting and Probability
(6.3)

By: Mustafa Jarrar

Counting and Probability (6.4)

By: Mustafa Jarrar

Counting and Probability (6.4.1)

By: Mustafa Jarrar

Counting and Probability
(6.5)

By: Mustafa Jarrar

Properties of Relations

By: Mustafa Jarrar

Equivalence Relations

By: Mustafa Jarrar

No comments:

Post a Comment

Follow by Email

Search This Blog

Jarrar Courses

Jarrar Courses