Lec 3.10: Master Theorem in Design and Analysis of Algorithm | Master Method for Recurrence Relation
Queueing Theory in Operation Research | Waiting Line Model in Operation Research | Queue Model
Graphical Method in Game Theory | 2xn and mx2 game without saddle point | Operation Research
Lec 3.1: Divide and Conquer | Recurrence Relation in DAA | How to Write Recurrence Relations | DSA
Lec 3.6: Recurrence Tree Method | T(n) =2T(n/2) +n | Recurrence Relation in DAA | DSA
Graphical Method in Game Theory Part 2 | m x 2 Game in Operation Research | Upper Envelope
Lec 3.12: Recurrence Relation Using Master Theorem | Master Theorem in design analysis of algorithm
Lec 2.1: Amortized Analysis | Aggregate Analysis for Stack Operation | DSA
Lec 3.9: Recursive Tree Method | Example 4 | T(n) = 2T(n-1) + 1 | Recurrence Relation in DAA
Lec 3.2: Substitution Method in DAA | Recurrence Relation | T(n) = 3T(n-1) | Design and Analysis
Lec 3.5: Substitution Method for Solving Recurrence Relations | T(n) = n+T(n-1) | Data Structure
Lec 4.13: Check the Number is Prime or Not | Brute force to Optimal Approach | DSA Complete Playlist
Lec 3.7: Recurrence Tree Method | T(n) = T(n/3) +T(2n/3) +n | Recurrence Relation in DAA
Simulation in Operation Research | Monte Carlo Simulation Problem | Random Number Problems
Lec 4.7: Factorial of a Number in Java | Iterative and Recursive Solution | Time & Space Complexity
Operating Characteristics of Queueing Theory | Traffic Intensity | Operation Research in Hindi
Game Theory in Operation Research | Pure Strategy Mixed Strategy | Payoff Matrix | Types of Game
Game Without Saddle Point | 2 x 2 Game without saddle Point | Problems Solved | Operation Research
Kendall's Notation in Queueing Theory | Operation Research in hindi
Maxima Minima Principle in Game Theory | Saddle Point in Game Theory | Operation Research in Hindi
N job m machine Sequencing Problem | Johnson Algorithm sequencing Problem | Operation Research
Lec 3.8: T(n) = T(n-1) +log n | Recursive Tree Method | Example 3 | Recurrence Relation in DAA
Lec 2.4: Accounting Method | Stack Operation Using Accounting Method | DSA
Lec-37 Critical Path Method In Operation Research | In Hindi
N job 3 machine Sequencing Problem | Johnson's Algorithm in Hindi | Operation Research
Monte Carlo Simulation Problem part 2 | Simulation problem in operation Research | Random Numbers
Lec 3.3: T(n) = 2T(n-1) -1 | Recurrence Relation Example 2 | Substitution Method in DAA | DSA
Lec-38 Program Evaluation And Review Technique In Hindi | PERT in Operation Research
Lec 3.13: Space Complexity of Recursive Algorithm | How to Find Space Complexity Recurrence Relation
Sequencing Problem | n job 2 machine sequencing Problem | Johnson Algorithm | operation research
Dominance Property in Game Theory | m x n Game without saddle point | Operation Research in hindi
2 Job m Machine Sequencing Problem | Operation Research | Using Graph | In Hindi
Lec 4.11: Armstrong Number in Java | Check a Number is Armstrong or Not | DSA Complete Playlist
Game Theory in Operation Research | Introduction of Maxima minima principle | Dominance property
Lec 4.12: Print All Factors of a Number | Print All Divisors of a Number | Brute force to optimal
My First YouTube Live | Lets Talk ❤ | #firstlivestream
Lec -6 Simplex Method Maximization Problem In Hindi || Solve an example || Operation Research
Model 2 (M/M/1) :(N/FCFS) | Queueing Theory in Operation Research | Formula Numerical Solution
Lec-16 Primal to dual conversion || Operation Research ||In Hindi || part ll
Lec 9: Time Complexity Part 2 | Time Complexity of the algorithm | Data Structure and Algorithm
Replacement Problem in Operation Research | Replacement models | Introduction of Group Replacement
Linear Programming Problem | Basic Concepts of LPP Model | Introduction to all variables in LPP
Model 1 (M/M/1) :(infinity/FCFS) Question problem Number 4 | Queueing Theory in operation Research
Lec 1.6: Best Case, Worst Case and Average Case Time Complexity | Types of Analysis
Replacement Problem | Example 2 | value of Money does not change with time | Operation Research
Sequencing Problem in Operation Research | Introduction of Sequencing problem | No passing Rule
Lec 5: Asymptotic Notation | Theta Notation | Theta Notation Examples | Data structure and Algorithm
Lec 6.10: Number of 1 Bits | Leetcode Problem | Bit Manipulation | Data Structure and Algorithm
Lec 6.8: Bit Masking | Set a Bit | Unset a Bit | Toggling of Bit | Check a Bit | Bit Manipulation
Lec 7: Properties of Asymptotic Notation | Characteristics of Asymptotic Notation | BigO Omega Theta
Dominance Property in Game Theory Example 2 | Dominance Rules in Game Theory | Operation Research
Lec 4.10: Fibonacci Series in Java | Data Structure and Algorithm Complete Playlist | DSA
Lec 6.1: Bit Manipulation | Introduction of Bit | Bit Representation | Binary of a Negative Number
Lec 2.3: Dynamic Table Using Aggregate Analysis | Amortized Analysis | DSA
Lec 2.7: Potential Method | Incrementing a Binary Number Using Potential Method | DSA
Group Replacement Problem in Operation Research| Replacement Problem that fails Suddenly | Hindi
Replacement Problem in Operation Research | Replacement Model | Solved Example | Hindi
Lec -2 Graphical Method Linear Programming Problem || For infinite Solution || In Operation Research
Model 1 (M/M/1) :(Infinity/FCFS) Numerical Problem 3 | Queueing theory in operation research
Lec 8: Time Complexity of the Algorithm | Time Complexity Part 1 | Data Structure full playlist
