1
Higher Engineering Mathematics (Prof. P. N. Agrawal, IIT Roorkee). Instructor: Prof. P. N. Agrawal, Department of Mathematics, IIT Roorkee.
FREE
This course includes
Hours of videos
1555 years, 4 months
Units & Quizzes
56
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This course is a basic course offered to UG/PG students of Engineering/Science background. It consists of four main topics : 1) Discrete mathematics, 2) Graph theory, 3) Linear programming problems, and 4) Queuing theory. (from nptel.ac.in)
Course Currilcum
- Lecture 01 – Symbolic Representation of Statements I Unlimited
- Lecture 02 – Symbolic Representation of Statements II Unlimited
- Lecture 03 – Tautologies and Contradictions Unlimited
- Lecture 04 – Predicates and Quantifiers I Unlimited
- Lecture 05 – Predicates and Quantifiers II Unlimited
- Lecture 06 – Validity of Arguments Unlimited
- Lecture 07 – Language and Grammars I Unlimited
- Lecture 08 – Language and Grammars II Unlimited
- Lecture 09 – Language and Grammars III Unlimited
- Lecture 10 – Finite-State Machines Unlimited
- Lecture 11 – Partially Ordered Sets I Unlimited
- Lecture 12 – Partially Ordered Sets II Unlimited
- Lecture 13 – Partially Ordered Sets III Unlimited
- Lecture 14 – Lattices I Unlimited
- Lecture 15 – Lattices II Unlimited
- Lecture 16 – Lattices III Unlimited
- Lecture 17 – Lattices IV Unlimited
- Lecture 18 – Lattices V Unlimited
- Lecture 19 – Boolean Algebra I Unlimited
- Lecture 20 – Boolean Algebra II Unlimited
- Lecture 21 – Boolean Algebra III Unlimited
- Lecture 22 – Boolean Algebra IV Unlimited
- Lecture 23 – Logic Gates Unlimited
- Lecture 24 – Karnaugh Map I Unlimited
- Lecture 25 – Karnaugh Map II Unlimited
- Lecture 26 – Various Types of Graphs I Unlimited
- Lecture 27 – Various Types of Graphs II Unlimited
- Lecture 28 – Paths and Connectivity Unlimited
- Lecture 29 – Subgraphs and Traversable Multigraphs Unlimited
- Lecture 30 – Undirected and Directed Graphs Unlimited
- Lecture 31 – Eulerian and Hamiltonian Graphs Unlimited
- Lecture 32 – Planar Graphs Unlimited
- Lecture 33 – Representation of Graphs Unlimited
- Lecture 34 – Isomorphic and Homeomorphic Graphs Unlimited
- Lecture 35 – Kuratowski’s Theorem Unlimited
- Lecture 36 – Dual of a Graph Unlimited
- Lecture 37 – Coloring of Graphs I Unlimited
- Lecture 38 – Coloring of Graphs II Unlimited
- Lecture 39 – Trees I Unlimited
- Lecture 40 – Trees II Unlimited
- Lecture 41 – Graphical Method I Unlimited
- Lecture 42 – Graphical Method II Unlimited
- Lecture 43 – General Linear Programming Problem Unlimited
- Lecture 44 – Simplex Method I Unlimited
- Lecture 45 – Simplex Method II Unlimited
- Lecture 46 – Big-M Method I Unlimited
- Lecture 47 – Big-M Method II (Special Cases) Unlimited
- Lecture 48 – Two Phase Method I Unlimited
- Lecture 49 – Two Phase Method II Unlimited
- Lecture 50 – Duality I Unlimited
- Lecture 51 – Duality II Unlimited
- Lecture 52 – Dual Simplex Method Unlimited
- Lecture 53 – Transportation Problem I Unlimited
- Lecture 54 – Transportation Problem II Unlimited
- Lecture 55 – Assignment Problem I Unlimited
- Lecture 56 – Assignment Problem II Unlimited
