RECURSIVE DEFINED FUNCTION | PIGEONHOLE PRINCIPAL | PROOFS OF CONTRADICTIONS
Advertisement
About this video
This video is part of the Discrete Mathematics (DMS) lecture series by Er Sahil Ka Gyan for RTU B.Tech students (4th Sem). It is video 17 of 56 in the series.
In this video, we will cover important topics of Discrete Mathematics including Recursive Defined Functions, Pigeonhole Principle, and Proof by Contradiction in a simple and easy-to-understand way. These topics are very important for B.Tech, BCA, MCA, and Computer Science students and are frequently asked in exams.
More from Discrete Mathematics (DMS)
9:5215
Inverse Function in Discrete Mathematics Structure
5:1316
Mathematical Induction in Discrete Mathematics
3:1218
Propositional Logic in Discrete Mathematics Structure
5:5019
First Order Logic | Universal and Existential Quantifiers in Discrete Mathematics Structure
14:1320
Logical Operations | Conjunction, Disjunction, Negation, Implication, only If | Discrete Mathematics
9:0821
Tautologies and Contradiction in Discrete Mathematics Structure
7:0422
Algebra of Propositional in Discrete Mathematics Structure | De morgan law , Distributive law
5:3423
Normal Forms in Discrete Mathematics Structure | CNF & DNF in discrete mathematics
Advertisement