The course covers fundamental concepts of discrete structure like introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in computer science.
1.1. Sets: Sets and Subsets, Power Set, Cartesian Product, Set Operations, Venn Diagram, Inclusion-Exclusion Principle, Computer Representation of Sets1.2. Functions: Bas. . .
21117+ Students
Questions : 11+
2.1 Integers: Integers and Division, Primes and Greatest Common Divisor, Extended Euclidean Algorithm, Integers and Algorithms, Applications of Number Theory (Linear Congruen. . .
12391+ Students
Questions : 14+
3.1. Logic: Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Negation of Quantified Statements, Proof of quantified statements, Nested Quantifiers. . .
11859+ Students
4.1. Induction: mathematical Induction, Strong Induction and Well Ordering, Induction in General 4.2. Recursive Definitions and Structural Induction, Recursive Algorithms, P. . .
9330+ Students
Questions : 12+
5.1. Counting: Basics of Counting, Pigeonhole Principle, Permutations and Combinations, Two Element Subsets, Counting Subsets of a Set, Binomial Coefficients, Generalized Per. . .
10057+ Students
6.1. Relations: Relations and their Properties, N-ary Relations with Applications, Representing Relations, Closure of Relations, Equivalence Relations, Partial Ordering 6.2.. . .
12891+ Students
Questions : 23+
Share this link via
Or copy link