Created by:

Profile Photo

Last updated:

September 23, 2023


Unlimited Duration


This course includes:

Unlimited Duration

Badge on Completion

Certificate of completion

Unlimited Duration


Discrete Mathematics (ArsDigita University). Taught by Professor Shai Simonson, this course covers the mathematical topics most directly related to computer science.

Topics covered this course included: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Emphasis will be placed on providing a context for the application of the mathematics within computer science. The analysis of algorithms requires the ability to count the number of operations in an algorithm. Recursive algorithms in particular depend on the solution to a recurrence equation, and a proof of correctness by mathematical induction. The design of a digital circuit requires the knowledge of Boolean algebra. Software engineering uses sets, graphs, trees and other data structures. Number theory is at the heart of secure messaging systems and cryptography. Logic is used in AI research in theorem proving and in database query systems. Proofs by induction and the more general notions of mathematical proof are ubiquitous in theory of computation, compiler design and formal grammars. Probabilistic notions crop up in architectural trade-offs in hardware design. (from ADUni.org)

Course Curriculum

  • Lecture 01 – What Kind of Problems are Solved in Discrete Math? Unlimited
  • Lecture 02 – Boolean Algebra and Formal Logic Unlimited
  • Lecture 03 – More Logic: Quantifiers and Predicates Unlimited
  • Lecture 04 – Sets Unlimited
  • Lecture 06 – Basic Arithmetic and Geometric Sums, Closed Forms Unlimited
  • Lecture 07 – Chinese Rings Puzzle Unlimited
  • Lecture 08 – Solving Recurrence Equations Unlimited
  • Lecture 09 – Solving Recurrence Equations (cont.) Unlimited
  • Lecture 10 – Mathematical Induction Unlimited
  • Lecture 11 – Combinations and Permutations Unlimited
  • Lecture 12 – Counting Problems Unlimited
  • Lecture 13 – Counting Problems (cont.) Unlimited
  • Lecture 14 – Counting Problems Using Combinations, Distributions Unlimited
  • Lecture 15 – Counting Problems Using Combinations, Distributions Unlimited
  • Lecture 16 – The Pigeonhole Principle and Examples Unlimited
  • Lecture 17 – Equivalence Relations and Partial Orders Unlimited
  • Lecture 18 – Euclid’s Algorithm Unlimited
  • Lecture 19 – Recitation – A Combinatorial Card Trick Unlimited
  • Lecture 20 – Cryptography Unlimited

About the instructor

5 5

Instructor Rating







Profile Photo
We are an educational and skills marketplace to accommodate the needs of skills enhancement and free equal education across the globe to the millions. We are bringing courses and trainings every single day for our users. We welcome everyone woth all ages, all background to learn. There is so much available to learn and deliver to the people.