InfoCoBuild

Higher Engineering Mathematics

Higher Engineering Mathematics (Prof. P. N. Agrawal, IIT Roorkee). Instructor: Prof. P. N. Agrawal, Department of Mathematics, IIT Roorkee. 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)

Lecture 56 - Assignment Problem II

Go to the Course Home or watch other lectures:

Lecture 01 - Symbolic Representation of Statements I

Lecture 02 - Symbolic Representation of Statements II

Lecture 03 - Tautologies and Contradictions

Lecture 04 - Predicates and Quantifiers I

Lecture 05 - Predicates and Quantifiers II

Lecture 06 - Validity of Arguments

Lecture 07 - Language and Grammars I

Lecture 08 - Language and Grammars II

Lecture 09 - Language and Grammars III

Lecture 10 - Finite-State Machines

Lecture 11 - Partially Ordered Sets I

Lecture 12 - Partially Ordered Sets II

Lecture 13 - Partially Ordered Sets III

Lecture 14 - Lattices I

Lecture 15 - Lattices II

Lecture 16 - Lattices III

Lecture 17 - Lattices IV

Lecture 18 - Lattices V

Lecture 19 - Boolean Algebra I

Lecture 20 - Boolean Algebra II

Lecture 21 - Boolean Algebra III

Lecture 22 - Boolean Algebra IV

Lecture 23 - Logic Gates

Lecture 24 - Karnaugh Map I

Lecture 25 - Karnaugh Map II

Lecture 26 - Various Types of Graphs I

Lecture 27 - Various Types of Graphs II

Lecture 28 - Paths and Connectivity

Lecture 29 - Subgraphs and Traversable Multigraphs

Lecture 30 - Undirected and Directed Graphs

Lecture 31 - Eulerian and Hamiltonian Graphs

Lecture 32 - Planar Graphs

Lecture 33 - Representation of Graphs

Lecture 34 - Isomorphic and Homeomorphic Graphs

Lecture 35 - Kuratowski's Theorem

Lecture 36 - Dual of a Graph

Lecture 37 - Coloring of Graphs I

Lecture 38 - Coloring of Graphs II

Lecture 39 - Trees I

Lecture 40 - Trees II

Lecture 41 - Graphical Method I

Lecture 42 - Graphical Method II

Lecture 43 - General Linear Programming Problem

Lecture 44 - Simplex Method I

Lecture 45 - Simplex Method II

Lecture 46 - Big-M Method I

Lecture 47 - Big-M Method II (Special Cases)

Lecture 48 - Two Phase Method I

Lecture 49 - Two Phase Method II

Lecture 50 - Duality I

Lecture 51 - Duality II

Lecture 52 - Dual Simplex Method

Lecture 53 - Transportation Problem I

Lecture 54 - Transportation Problem II

Lecture 55 - Assignment Problem I

Lecture 56 - Assignment Problem II