-
Course Overview
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
No items in this section -
Set Theory
-
Logic
- Laws Of Logic With Solved Example
- Logical Equivalence with Solved Examples
- Statement forms Tautology Contradiction and Contingency | Part 1 |
- Statement forms Tautology Contradiction and Contingency | Part 2 |
- Mathematical Induction | Part 01 |
- Mathematical Induction | Part 02 |
- Logical Statements and Symbolization with Example
-
Relations & Functions
-
Counting
-
Trees & Graphs
-
DSGT Notes
-
Discrete Structures and Graph Theory Viva Question
Inclusion-Exclusion Principle
Inclusion-Exclusion Principle
A well-known application of the inclusion–exclusion principle is to the combinatorial problem of counting all derangements of a finite set. It follows that if all bijections are assigned the same probability then the probability that a random bijection is a derangement quickly approaches 1/e as n grows.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!
Leave A Reply
You must be logged in to post a comment.
5 Comments
Discrete maths ke Sab topic pe lectures nahi hai kya
Wonderfull, and helpfull.
Thanks a lot!!!!!!!!!!!!!!!!
Thanku
So much🌸🌸
Explained very well…. thanks for your lecture
Thankyou for sharing 💓💓💝