Math 2.0

Resources / course

Higher Engineering Mathematics KJHY23BMXT

URIm2://res/KJHY23BMXT
Kindcourse
CreatorsP. N. Agrawal (instructor)
Date2019-06-20
Scopein
Idscourse 00582g326:111107127

Expressions

e1: edition

Languageen
Date2019-06-20
Contents
  • part 1: Unit 1
  • session 1: Symbolic Representation of Statements-I
  • session 2: Symbolic Representation of Statements-II
  • session 3: Tautologies and Contradictions
  • session 4: Predicates and Quantifires-I
  • session 5: Predicates and Quantifiers-II
  • part 2: Unit 2
  • session 6: Validity of Arguments
  • session 7: Language and Grammers-I
  • session 8: Language and Grammers-II
  • session 9: Language and Grammers-III
  • session 10: Finite- State Machines
  • part 3: Unit 3
  • session 11: Partially Ordered Sets- I
  • session 12: Partially Ordered Sets- II
  • session 13: Partial Ordered Sets-III
  • session 14: Lattices-I
  • session 15: Lattices-II
  • part 4: Unit 4
  • session 16: Lattices-III
  • session 17: Lattices-IV
  • session 18: Lattices-V
  • session 19: Boolean Algebra-I
  • session 20: Boolean Algebra-II
  • part 5: Unit 5
  • session 21: Boolean Algebra-III
  • session 22: Boolean Algebra-IV
  • session 23: Logic Gates
  • session 24: Karnaugh Map-I
  • session 25: Karnaugh Map-II
  • part 6: Unit 6
  • session 26: Various type of Graphs-I
  • session 27: Various types of Graphs-II
  • session 28: Paths and Connectivity
  • session 29: Subgraphs and Traversable Multigraphs
  • session 30: Undirected and Directed Graphs
  • part 7: Unit 7
  • session 31: Eulerian and Hamiltonian Graphs
  • session 32: Planar Graphs
  • session 33: Representation of Graphs
  • session 34: Isomorphic and Homeomorphic Graphs
  • session 35: Kuratowski's Theorem
  • part 8: Unit 8
  • session 36: Dual of a Graph
  • session 37: Coloring of Graphs - I
  • session 38: Coloring of Graphs - II
  • session 39: Tree -I
  • session 40: Tree - II
  • part 9: Unit 9
  • session 41: Graphical Method-I
  • session 42: Graphical Method-II
  • session 43: General Linear Programming Problem
  • session 44: Simplex Method - I
  • session 45: Simplex Method - II
  • part 10: Unit 10
  • session 46: Big - M Method - I
  • session 47: Big M Method -II (Special Cases)
  • session 48: Two Phase Method -I
  • session 49: Two Phase method - II
  • session 50: Duality - I
  • part 11: Unit 11
  • session 51: Duality-II
  • session 52: Dual Simplex Method
  • session 53: Transportation Problem - I
  • session 54: Transportation Problem-II
  • session 55: Assignment Problem-I
  • part 12: Unit 12
  • session 56: Assignment Problem-II

Catalogue records