Discrete Math: Counting Theory
|
Learn about counting theory and its relevance to computer science, and dive into the pigeonhole principle.
About this course
Continue your Discrete Math learning journey with Discrete Math: Counting Theory. Learn about the important rules of counting theory, some interesting patterns, and the application of counting theory in computer science. Use Python sets to represent and solve various counting problems.
Skills you’ll gain
Learn about Pascal’s Triangle
Use counting rules
Solve problems using Python
Notes on Prerequisites
We recommend that you complete Discrete Math: Permutations and Combinations before completing this course
User Reviews
Be the first to review “Discrete Math: Counting Theory”
Related Products
Math for Data Science
This Free Online Course Includes: 5-6 Hours of Learning CPD Accreditation Final Assessment
How to Use Microsoft Excel Power Pivot
This Free Online Course Includes: 1.5-3 Hours of Learning CPD Accreditation Final Assessment
Introduction to R Programming
This Free Online Course Includes: 1.5-3 Hours of Learning CPD Accreditation Final Assessment
Statistics: Effectively Displaying Data
This Free Online Course Includes: 1.5-3 Hours of Learning CPD Accreditation Final Assessment
Explainable AI Explained
This Free Online Course Includes: 4-5 Hours of Learning CPD Accreditation Final Assessment
Advanced Diploma in Python Programming for the Novice to Expert
This Free Online Course Includes: 15-20 Hours of Learning CPD Accreditation Final Assessment
There are no reviews yet.