-
Course Overview 0
No items in this section -
Set Theory 6
-
Lecture2.1
-
Lecture2.2
-
Lecture2.3
-
Lecture2.4
-
Lecture2.5
-
Lecture2.6
-
-
Logic 7
-
Lecture3.1
-
Lecture3.2
-
Lecture3.3
-
Lecture3.4
-
Lecture3.5
-
Lecture3.6
-
Lecture3.7
-
-
Relations & Functions 5
-
Lecture4.1
-
Lecture4.2
-
Lecture4.3
-
Lecture4.4
-
Lecture4.5
-
-
Counting 1
-
Lecture5.1
-
-
Trees & Graphs 4
-
Lecture6.1
-
Lecture6.2
-
Lecture6.3
-
Lecture6.4
-
-
DSGT Notes 6
-
Lecture7.1
-
Lecture7.2
-
Lecture7.3
-
Lecture7.4
-
Lecture7.5
-
Lecture7.6
-
-
Discrete Structures and Graph Theory Viva Question 6
-
Lecture8.1
-
Lecture8.2
-
Lecture8.3
-
Lecture8.4
-
Lecture8.5
-
Lecture8.6
-
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 Cancel 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 ๐๐๐