-
About this Course 0
No items in this section -
Engineering Mathematics - III [Module 1] :- LINEAR ALGEBRA / MATRICES 13
-
Introduction to Matrices 07 minLecture2.1
-
Eigen value and Eigen vector in Matrices 17 minLecture2.2
-
Eigen value and Eigen vectors for Types of Matrices 06 minLecture2.3
-
Cayley Hamilton Theorem with Example Part 1 09 minLecture2.4
-
Cayley Hamilton Theorem with Example Part 2 05 minLecture2.5
-
Cayley Hamilton Theorem with Example Part 3 04 minLecture2.6
-
Monic and Minimal Polynomial of a Matrix 05 minLecture2.7
-
Algebraic multiplicity And Geometric multiplicity 10 minLecture2.8
-
Functions of a Square Matrix in Matrices 07 minLecture2.9
-
Reduction of Quadratic form to Canonical form 13 minLecture2.10
-
Orthogonal Matrix with Solved Example 09 minLecture2.11
-
Matrices NotesLecture2.12
-
Matrices Practice Problem and Solution KeyLecture2.13
-
-
Engineering Mathematics - III [Module 2] :- LINEAR PROGRAMMING PROBLEM LPP 10
-
Basics of simplex method in LPP 11 minLecture3.1
-
Standard form of LPP Simplex Method 12 minLecture3.2
-
Types of Solutions in Simplex Method in LPP 14 minLecture3.3
-
How to Solve LPP using Simplex method 18 minLecture3.4
-
LPP Using Big M method ( Penalty Method ) 25 minLecture3.5
-
Duality of LPP ( Primal and Dual ) 17 minLecture3.6
-
Relationship between Primal and Dual 17 minLecture3.7
-
Dual Simplex Method in LPP 17 minLecture3.8
-
Linear Programming Problems NotesLecture3.9
-
Linear Programming Practice Problem and Solution KLecture3.10
-
-
Engineering Mathematics - III [Module 3] :- Non Linear Programming Problems 6
-
1. Nonlinear Programming Problems with no constraint 16 minLecture4.1
-
2. Nonlinear Programming Problems with one equality constraint 21 minLecture4.2
-
3-Nonlinear Programming Problems with more than one equality constraint 15 minLecture4.3
-
4-Example of Nonlinear Programming Problems with more than one equality constraint 13 minLecture4.4
-
5-Nonlinear Programming Problems using Kuhn-Tucker conditions 13 minLecture4.5
-
6- General nonlinear Programming Problems using Kuhn-Tucker conditions 18 minLecture4.6
-
-
Engineering Mathematics - III [Module 4] :- Fourier Series 10
-
Introduction to Fourier series 23 minLecture5.1
-
Fourier Series solved example 31 minLecture5.2
-
Even and Odd theory concept in Fourier Series 13 minLecture5.3
-
Even Solved Example 24 minLecture5.4
-
Odd solved Example 13 minLecture5.5
-
Half range cosine and sine Theory Concept 03 minLecture5.6
-
Half range cosine solved example 17 minLecture5.7
-
Half range sine Solved example 12 minLecture5.8
-
Fourier_Series_MCQLecture5.9
-
Fourier_Series_NotesLecture5.10
-
-
Engineering Mathematics - III [Module 5] :- Statistical Techniques 11
-
Introduction to correlation 08 minLecture6.1
-
Karl Pearson coefficient correlation 06 minLecture6.2
-
Spearmans Rank (correlation) 13 minLecture6.3
-
Introduction to Regression 05 minLecture6.4
-
Regression Part 2 13 minLecture6.5
-
Regression part 3 15 minLecture6.6
-
Curve Fitting part 1 05 minLecture6.7
-
Curve Fitting part 2 09 minLecture6.8
-
Curve Fitting part 3 14 minLecture6.9
-
Curve Fitting part 4 08 minLecture6.10
-
Correlation,Regression and Curve Fitting NotesLecture6.11
-
-
Engineering Mathematics - III [Module 6] :- Probability 11
-
Introduction to Probability Distribution 07 minLecture7.1
-
Discrete Random Variable in Probability Distribution 15 minLecture7.2
-
Distribution function of Discrete Random Variable 10 minLecture7.3
-
Continuous Random Variable in Probability Distribution 09 minLecture7.4
-
Continuous Distribution Function in Probability Distribution 14 minLecture7.5
-
Expectation in Probability Distribution 12 minLecture7.6
-
Mean and Variance Part 1 in Probability Distribution 11 minLecture7.7
-
Mean and Variance Part 2 in Probability Distribution 13 minLecture7.8
-
Moments and Moments Generating Function Part #1 in Probability Distribution 13 minLecture7.9
-
Moments and Moments Generating Function Part #2 in Probability Distribution 11 minLecture7.10
-
Probability NotesLecture7.11
-
-
Engineering Mathematics - III [Module 7] :- Modular Arithmetics 5
-
1 – Congruence 34 minLecture8.1
-
2 – Congruence – Questions 15 minLecture8.2
-
3 – Chinese Remainder Theorem 29 minLecture8.3
-
4 – Fermat & Euler Theorem 23 minLecture8.4
-
5 – Rsa Algorithm 19 minLecture8.5
-
-
Discrete Structures & Graph Theory [Module 1] :- Logic 10
-
Laws Of Logic 10 minLecture9.1
-
Logical Equivalence 12 minLecture9.2
-
Statement forms Tautology Contradiction and Contingency | Part 1 | 07 minLecture9.3
-
Statement forms Tautology Contradiction and Contingency | Part 2 | 10 minLecture9.4
-
Mathematical Induction | Part 01 | 08 minLecture9.5
-
Mathematical Induction | Part 02 | 12 minLecture9.6
-
Mathematical Induction | Part 03 | 07 minLecture9.7
-
Logical Statements and Symbolization 11 minLecture9.8
-
CNF and DNFLecture9.9
-
Converse, Inverse & Contrapositive 10 minLecture9.10
-
-
Discrete Structures & Graph Theory [Module 2] :- Relations & Functions 15
-
Set Theory | Part 1 | 18 minLecture10.1
-
Set Theory | Part 2 | 08 minLecture10.2
-
Set Theory | Part 3 | 07 minLecture10.3
-
Set Theory | Part 4 | 10 minLecture10.4
-
Set theory | Part 5 | 10 minLecture10.5
-
Inclusion-Exclusion Principle 18 minLecture10.6
-
Warshall Algorithm 10 minLecture10.7
-
Warshall’s Algorithm – Numerical #2 11 minLecture10.8
-
Warshall’s Algorithm – Numerical #1 17 minLecture10.9
-
Bijective Function & Numerical 08 minLecture10.10
-
Functions – Numerical #1 04 minLecture10.11
-
Equivalence Relation #1 03 minLecture10.12
-
Generating Functions – Numerical #1 05 minLecture10.13
-
Exponential Generating Function – Numerical 06 minLecture10.14
-
Functions (f o g o h , g o h o f) – Numerical 04 minLecture10.15
-
-
Discrete Structures & Graph Theory [Module 3] :- Posets & Lattice 4
-
Hasse Diagram and Posets 11 minLecture11.1
-
Lattices and Posets 14 minLecture11.2
-
Hasse Diagram – D72 & D105 08 minLecture11.3
-
Distributive lattice & D1001 Hasse DiagramLecture11.4
-
-
Discrete Structures & Graph Theory [Module 4] :- Counting 6
-
Inclusion-Exclusion Principle 18 minLecture12.1
-
Pigeonhole and Extended Pigeonhole Principle 08 minLecture12.2
-
Recurrence Relation Using Iteration 09 minLecture12.3
-
Pigeonhole Principle – Numerical 05 minLecture12.4
-
Recurrence Relation – Numerical #1 12 minLecture12.5
-
Venn Diagram – Numerical #1 05 minLecture12.6
-
-
Discrete Structures & Graph Theory [Module 5] :-Algebraic Structures 6
-
Ring Concept With Numerical 18 minLecture13.1
-
Groupoid, Semi-Group, Monoid 13 minLecture13.2
-
Group, Abelian Group, Cyclic Group 10 minLecture13.3
-
Group Code Using Parity Matrix 10 minLecture13.4
-
Practice Question, Group Theory 15 minLecture13.5
-
Hamming distance _ Parity check matrix 11 minLecture13.6
-
-
Discrete Structures & Graph Theory [Module 6] :- Graph Theory 9
-
Kruskal’s Algorithm 09 minLecture14.1
-
Prim’s Or Dijkstra’s Algorithm 10 minLecture14.2
-
Welch-Powell Graph Coloring 09 minLecture14.3
-
Hamiltonian Graphs 13 minLecture14.4
-
Isomorphism Of Graphs 13 minLecture14.5
-
Euler Graphs 15 minLecture14.6
-
Incidence Matrix 08 minLecture14.7
-
Path & Circuit – Numerical #1Lecture14.8
-
Path & Circuit – Numerical #2Lecture14.9
-
-
Discrete Structures & Graph Theory [Notes] :- 6
-
LogicLecture15.1
-
Relations and FunctionsLecture15.2
-
Posets and LatticeLecture15.3
-
CountingLecture15.4
-
Algebraic StructuresLecture15.5
-
Graph TheoryLecture15.6
-
-
Discrete Structures and Graph Theory [Viva Question]:- 6
-
Basic Concepts in ProbabilityLecture16.1
-
Relations and FunctionsLecture16.2
-
Posets and LatticeLecture16.3
-
CountingLecture16.4
-
Algebraic StructuresLecture16.5
-
Graph TheoryLecture16.6
-
-
Discrete Structures & Graph Theory [ IMPs ] :- 7
-
LogicLecture17.1
-
Relations and FunctionsLecture17.2
-
Posets and LatticeLecture17.3
-
CountingLecture17.4
-
Algebraic StructuresLecture17.5
-
Graph TheoryLecture17.6
-
[Extra] Previously Asked Important QuestionsLecture17.7
-
-
Computer Organization and Architecture [Module 1]:- Computer Fundamentals 11
-
Number System 07 minLecture18.1
-
Binary Number System 11 minLecture18.2
-
Octal Number System 09 minLecture18.3
-
Hexadecimal Number System 07 minLecture18.4
-
Logic Gates – 1 12 minLecture18.5
-
Logic Gates – 2 08 minLecture18.6
-
Universal Gates 13 minLecture18.7
-
Excess – 3 06 minLecture18.8
-
Gray Code 07 minLecture18.9
-
Introduction – Computer Organization 09 minLecture18.10
-
Von Neumann Architecture 13 minLecture18.11
-
-
Computer Organization and Architecture [Module 2]:- ALU Operations 9
-
Booth’s Algorithm with Solved Example Part #1 15 minLecture19.1
-
Booth’s Algorithm with Solved Example Part #2 10 minLecture19.2
-
Booth’s Algorithm with Solved Example Part #3 08 minLecture19.3
-
Restoring Division Part #1 18 minLecture19.4
-
Restoring Division Part #2 10 minLecture19.5
-
Non Restoring Division Part #1 12 minLecture19.6
-
Non Restoring Division Part #2 10 minLecture19.7
-
Binary Numeric Data RepresentationLecture19.8
-
Floating Point Number Representation in IEEE 754 17 minLecture19.9
-
-
Computer Organization and Architecture [Module 3]:- Processor Organization and Architecture 15
-
8086 Addressing Modes 13 minLecture20.1
-
Hardwired Control Unit 08 minLecture20.2
-
Microprogrammed Control Unit 08 minLecture20.3
-
Hardwired CU vs Micro-programmed CU 10 minLecture20.4
-
Pipelining Hazards 08 minLecture20.5
-
RISC Microprocessor 12 minLecture20.6
-
CISC Microprocessor 09 minLecture20.7
-
Instruction Cycles and Interrupt Mechanism 07 minLecture20.8
-
Half and Full Adder 13 minLecture20.9
-
Multiplexer and demultiplexer 07 minLecture20.10
-
S-R Flip Flop 08 minLecture20.11
-
J-k Flip Flop 05 minLecture20.12
-
D Flip Flop & T Flip Flop 06 minLecture20.13
-
Addressing Modes – Part 01 12 minLecture20.14
-
Addressing Modes – Part 02 13 minLecture20.15
-
-
Computer Organization and Architecture [Module 4]:- Memory Organization 10
-
Memory and its characteristics 09 minLecture21.1
-
DRAM ( Dynamic RAM ) 07 minLecture21.2
-
SRAM (Static RAM) 08 minLecture21.3
-
Memory Hierarchy and Locality of Reference 13 minLecture21.4
-
Cache Memory Full Concept with working 07 minLecture21.5
-
Cache Coherence Single and Multiprocessor 11 minLecture21.6
-
Cache Coherence Strategies 09 minLecture21.7
-
MESI protocol 11 minLecture21.8
-
Interleaved Memory 10 minLecture21.9
-
Numerical On Memory – #1 19 minLecture21.10
-
-
Computer Organization and Architecture [Module 5]:- I / O Organization 5
-
IO Module, Functions, Requirement & Types 11 minLecture22.1
-
Programmed IO 12 minLecture22.2
-
Interrupt Driven IO 11 minLecture22.3
-
DMA Driven IO 13 minLecture22.4
-
8257 DMA CONTROLLER 16 minLecture22.5
-
-
Computer Organization and Architecture [Module 6]:- Parallel Processing 8
-
80386 09 minLecture23.1
-
Real Protected and Virtual mode of 80386 08 minLecture23.2
-
80386 Protection Mechanism 19 minLecture23.3
-
Pipelining Hazards 08 minLecture23.4
-
Branch Prediction Logic 06 minLecture23.5
-
Amdahl’s law 07 minLecture23.6
-
Parallel Processing and Applications 13 minLecture23.7
-
Flynn’s Classification 10 minLecture23.8
-
-
Computer Organization and Architecture [Notes]:- 6
-
Module 01 – Fundamentals Of Logic DesignLecture24.1
-
Module 03 – Processor Organization and ArchLecture24.2
-
Module 02 – Overview Of Computer Org and ArchLecture24.3
-
Module 04 – Data Representation & Arithmetic AlgoLecture24.4
-
Module 05 – Memory OrganixationLecture24.5
-
Module 06 – I/O OrganizationLecture24.6
-
-
AOA [Module 1] :- Introduction 5
-
Introduction to AOA (Analysis of Algorithm ) 10 minLecture25.1
-
Asymptotic Notations 03 minLecture25.2
-
Time Complexity and Big O 22 minLecture25.3
-
Space Complexity 15 minLecture25.4
-
Insertion sort 08 minLecture25.5
-
-
AOA [Module 2] :- Divide and Conquer Approach 7
-
Divide & Conquer With Example 06 minLecture26.1
-
Binary Search 10 minLecture26.2
-
Merge Sort Algorithm with Solved Example 20 minLecture26.3
-
Quick Sort Algorithm web 17 minLecture26.4
-
Quick Sort Algorithm Explained with Example 15 minLecture26.5
-
Multiplying Long Integers Using Divide and Conquer Technique 09 minLecture26.6
-
Max Min Problem with Solved Example 08 minLecture26.7
-
-
AOA [Module 3] :- Greedy Method Approach 4
-
Prim’s algorithm for Minimum Spanning Tree 19 minLecture27.1
-
Flowshop Scheduling Explained 15 minLecture27.2
-
Dijkstra’s Algorithm with Solved Example 14 minLecture27.3
-
Kruskal algorithm for Minimum Spanning Tree With Example 13 minLecture27.4
-
-
AOA [Module 4] :- Dynamic Programming Approach 9
-
Dynamic Programming 10 minLecture28.1
-
DP Approaches -1 10 minLecture28.2
-
DP Approaches -2 07 minLecture28.3
-
Multistage Graphs 19 minLecture28.4
-
Knapsack Problem part 1 09 minLecture28.5
-
Knapsack Problem Part 2 08 minLecture28.6
-
Knapsack Problem Part 3 05 minLecture28.7
-
Travelling Salesperson Problem with Solved Example 14 minLecture28.8
-
Multistage Graphs Problem with Solved Example 25 minLecture28.9
-
-
AOA [Module 5] :- Backtracking and Branch and bound 7
-
Sum of Subsets Problem Explained #1 Backtracking 08 minLecture29.1
-
15 Puzzle Problem Explained with Example 10 minLecture29.2
-
Concept Of Backtracking 09 minLecture29.3
-
4-Queen’s Problem 07 minLecture29.4
-
8-Queen’s Problem 13 minLecture29.5
-
Concept Of Branch and Bound 07 minLecture29.6
-
15 puzzle 11 minLecture29.7
-
-
AOA [Module 6] :- String Matching Algorithms 4
-
Naive Pattern Matching 14 minLecture30.1
-
Knuth Morris Pratt Algorithm 14 minLecture30.2
-
Longest Common Subsequence – #1 21 minLecture30.3
-
Longest Common Subsequence – #2 10 minLecture30.4
-
-
AOA:- Importance with Solution 3
-
AOA Importance Solutions (All Modules)Lecture31.1
-
Top 10 Most Important AOA QuestionsLecture31.2
-
AOA Module Wise ImportanceLecture31.3
-
-
AOA:- Viva 6
-
1. Introduction to AOALecture32.1
-
2. Divide and Conquer ApproachLecture32.2
-
3. Greedy Method ApproachLecture32.3
-
4 Dynamic Programming ApproachLecture32.4
-
5. Backtracking and Branch and BoundLecture32.5
-
6. String Matching AlgorithmLecture32.6
-
Basics of simplex method in LPP
Basics of simplex method in LPP
Simplex method is an approach to solving linear programming models by hand using slack variables, tableaus, and pivot variables as a means to finding the optimal solution of an optimization problem. Simplex tableau is used to perform row operations on the linear programming model as well as for checking optimality.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
![]()
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!

