Discrete mathematics is the study of discontinuous quantities, and associated algorithms.
Course: Discrete Maths and Algorithms, Monsoon 2019
Taught by: Prof. Bapi Raju S.
- Discrete Mathematics: Graph algorithms
- Discrete Mathematics: Convex Hull algorithms
- Discrete Mathematics: GCD, Fermat's little theorem
- Discrete Mathematics: 2 Jug puzzle, Fermat's little theorem
- Discrete Mathematics: Fibonacci series, Catalan numbers
- Discrete Mathematics: Josephus problem
- Discrete Mathematics: Extended master's theorem
- Discrete Mathematics: Recurrence relations using formulae
- Discrete Mathematics: Recursion, induction, recurrence relation
- Discrete Mathematics: Solving recurrence relations 2
- Discrete Mathematics: Solving recurrence relations
- Discrete Mathematics: Recurrence relations 2
- Discrete Mathematics: Recurrence relations
- Discrete Mathematics: Relations
- Discrete Mathematics: Group theory
- Discrete Mathematics: Computable and uncomputable functions 2
- Discrete Mathematics: Computable and uncomputable functions
- Discrete Mathematics: Rates of growth of functions 2
- Discrete Mathematics: Rates of growth of functions
- Discrete Mathematics: Cardinality of sets 2
- Discrete Mathematics: Cardinality of sets
- Discrete Mathematics: Sets
- Discrete Mathematics: Set theory
- Discrete Mathematics: NP-completeness and Reduction
- Discrete Mathematics: Logic reduction
- Discrete Mathematics: Proofs and Logic 2
- Discrete Mathematics: Proofs and logic
- Discrete Mathematics: Topics