CS001 Assignment 3 Solution Spring 2021

Discrete Math #11 | Relations | Kinza Bilal

Discrete Math #10 | Applications of venn diagram | Kinza Bilal

Discrete Math #9 | Set identities | Kinza Bilal

Discrete Math #7 | Set theory | Kinza Bilal

Discrete Math #6 | Switches and circuits | Kinza Bilal

Discrete Math #4 | Biconditional | Kinza Bilal

Discrete Math #5 | Valid and invalid arguments | MTH202 lecture 5 | Kinza Bilal

Discrete Math #2 | Truth Tables | Kinza Bilal

Discrete Math #1 | Logic | Kinza Bilal

Discrete Math#44 | Tree | Rooted Tree | Binary Tree | Kinza Bilal

Discrete Math#42 | Isomorphism of graphs | Degree Sequence | Kinza Bilal

Discrete Math#43 | Planar graphs | Euler's Formula | Graph Coloring | Kinza Bilal

Discrete Math#41 | Matrix Representation of graphs|Adjacency Matrix |Incidence Matrix|Directed Graph

Discrete Math#40 | Paths and circuits| Konigsberg Bridge Problem|Euler's Circuit|Hamiltonian Circuit

Discrete Math#39 | Introduction to graphs | Handshaking theorem | Bipartite graph | Complete graph

Discrete Math#38|Random variable| Probability distribution|Expectation |Variance |Standard variation

Discrete Math # 36 | Laws of probability | Addition law | Probability of sub event | Kinza Bilal

Discrete Math #35 | Introduction to Probability | Event | Sample Space | Kinza Bilal

Discrete Math #34 | Inclusion-Exclusion Principle | Pigeon Hole Principle | Kinza Bilal

Discrete Math #33 | Tree Diagram | Inclusion - Exclusion Principle | Kinza Bilal

Discrete Math #32 | Ordered and unordered partitions | Permutations with repitition | Kinza Bilal

Discrete Math #31 | K - Combinations | K - Selections | Kinza Bilal

Discrete Math #30 | Permutations | Factorial | K Sample | Kinza bilal

Discrete Math#29 | Combinatorics | The sum rule | The product rule | Discrete math | Kinza Bilal