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.

By: Mustafa Jarrar 
By: Mustafa Jarrar 
By: Mustafa Jarrar 
By: Mustafa Jarrar 
By: Mustafa Jarrar 
By: Mustafa Jarrar 
By: Mustafa Jarrar 
By: Mustafa Jarrar 
By: Mustafa Jarrar 
OnetoOne, Onto, Inverse Functions By: Mustafa Jarrar 
Application: The Pigeonhole Principle By: Mustafa Jarrar 
By: Mustafa Jarrar 
Counting and Probability By: Mustafa Jarrar 
Counting and Probability (6.4) By: Mustafa Jarrar 
Counting and Probability (6.4.1) By: Mustafa Jarrar 
Counting and Probability By: Mustafa Jarrar 
By: Mustafa Jarrar 
By: Mustafa Jarrar 
No comments:
Post a Comment