Free Live Session on
Topic:- Spanning Tree in Graph Theory | Examples | Number of Spanning Tree in a tree | Kirchhoff theorem
Date:-31.05.2021
Class Timing:-6.00 p.m
Subscribe the Channel
Link:-
https://youtu.be/y1rjkuuY3xE
Topic:- Spanning Tree in Graph Theory | Examples | Number of Spanning Tree in a tree | Kirchhoff theorem
Date:-31.05.2021
Class Timing:-6.00 p.m
Subscribe the Channel
Link:-
https://youtu.be/y1rjkuuY3xE
YouTube
41 Spanning Tree in Graph theory | Examples | Number of Spanning Tree in a tree | Kirchhoff theorem
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Spanning Tree in Graph Explained with Examples
2) Number of Spanning Tree in a tree
3) Kirchhoff theorem
4) Algorithm
Timetable:
-----------------
Contact Details and…
In this video I have explained:-
1) Spanning Tree in Graph Explained with Examples
2) Number of Spanning Tree in a tree
3) Kirchhoff theorem
4) Algorithm
Timetable:
-----------------
Contact Details and…
Free Live Session on
Topic:- Minimum Cost Spanning Tree (MST) | Prims Algorithm Implementation with and without min Heap | GPY
Date:-01.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/-U48aLSif3k
Topic:- Minimum Cost Spanning Tree (MST) | Prims Algorithm Implementation with and without min Heap | GPY
Date:-01.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/-U48aLSif3k
YouTube
42 Minimum Cost Spanning Tree (MST) | Prims Algorithm Implementation with and without min heap | GPY
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Minimum Cost Spanning Tree (MST)
2) Prims Algorithm
3) Prims Algorithm Implementation with min-heap
4) Prims Algorithm Implementation Without min-heap
5) Prims Algorithm…
In this video I have explained:-
1) Minimum Cost Spanning Tree (MST)
2) Prims Algorithm
3) Prims Algorithm Implementation with min-heap
4) Prims Algorithm Implementation Without min-heap
5) Prims Algorithm…
Free Live Session on
Topic:- Kruskal's Algorithm for minimum Spanning Trees | Greedy Method | Time Complexity Analysis |GPY
Date:-04.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/axXgKFgZniE
Topic:- Kruskal's Algorithm for minimum Spanning Trees | Greedy Method | Time Complexity Analysis |GPY
Date:-04.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/axXgKFgZniE
YouTube
43 : Kruskal's Algorithm for minimum spanning trees | Greedy Method | Time Complexity Analysis | GPY
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Kruskal's Algorithm For Minimum Spanning Tree
2) Greedy Method
3) Time Complexity of Kruskal's Algorithm
4) Practise questions of Kruskal's Algorithm
5) Gate Previous…
In this video I have explained:-
1) Kruskal's Algorithm For Minimum Spanning Tree
2) Greedy Method
3) Time Complexity of Kruskal's Algorithm
4) Practise questions of Kruskal's Algorithm
5) Gate Previous…
Free Live Session on
Topic:- Dijkstra Algorithm Single Source Shortest Path | Greedy Algorithm | Time & Space Complexity | GPY
Date:-05.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/pY6El7aftYc
Topic:- Dijkstra Algorithm Single Source Shortest Path | Greedy Algorithm | Time & Space Complexity | GPY
Date:-05.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/pY6El7aftYc
YouTube
44 Dijkstra Algorithm Single Source Shortest Path | Greedy Algorithm | Time & Space Complexity | GPY
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Dijkstra Algorithm Single Source Shortest Path
2) Greedy Algorithm
3) Time and Space Complexity of Dijkstra Algorithm
4) Gate Previous Year Questions on Dijkstra Algorithm…
In this video I have explained:-
1) Dijkstra Algorithm Single Source Shortest Path
2) Greedy Algorithm
3) Time and Space Complexity of Dijkstra Algorithm
4) Gate Previous Year Questions on Dijkstra Algorithm…
Free Live Session on
Topic:- Bellman Ford Algorithm | Single Source Shortest Path | Bellman V/S Dijkstra | Time complexity
Date:-06.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/yiJ6T5_b5w8
Topic:- Bellman Ford Algorithm | Single Source Shortest Path | Bellman V/S Dijkstra | Time complexity
Date:-06.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/yiJ6T5_b5w8
YouTube
45 Bellman Ford Algorithm | Single Source Shortest Path | Bellman V/S Dijkstra | Time Complexity
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Bellman Ford Algorithm
2) Single Source Shortest Path
3) Bellman V/S Dijkstra
4) Time Complexity Analysis of Bellman Ford Algorithm
5) Bellman Ford Algorithm detect negative…
In this video I have explained:-
1) Bellman Ford Algorithm
2) Single Source Shortest Path
3) Bellman V/S Dijkstra
4) Time Complexity Analysis of Bellman Ford Algorithm
5) Bellman Ford Algorithm detect negative…
Free Live Session on
Topic:- Introduction to Dynamic Programming | Fibonacci Series | Dynamic Programming VS Divide and Conquer
Date:-07.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/ETXET6ZQnCk
Topic:- Introduction to Dynamic Programming | Fibonacci Series | Dynamic Programming VS Divide and Conquer
Date:-07.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/ETXET6ZQnCk
YouTube
46 Introduction to Dynamic Programming | Fibonacci Series |Dynamic Programming vs Divide and Conquer
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Introduction to Dynamic Programming
2) Dynamic Programming VS Divide And Conquer
3) Fibonacci Series Dynamic Programming
4) When to apply dynamic programming
5) Why to…
In this video I have explained:-
1) Introduction to Dynamic Programming
2) Dynamic Programming VS Divide And Conquer
3) Fibonacci Series Dynamic Programming
4) When to apply dynamic programming
5) Why to…
Free Live Session on
Topic:- Matrix Chain Multiplication | Dynamic Programming | Number of Scalar Multiplication | Parenthesis
Date:-08.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/FhsZzgXkr5A
Topic:- Matrix Chain Multiplication | Dynamic Programming | Number of Scalar Multiplication | Parenthesis
Date:-08.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/FhsZzgXkr5A
YouTube
47 Matrix Chain Multiplication Dynamic Programming | Number of Scalar Multiplication | Parenthesis
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Matrix Multiplication
2) Matrix Chain Multiplication
3) Scalar Multiplication
4) Dynamic Programming
5) Time Complexity of Matrix Multiplication
6) Number of Scalar Multiplication…
In this video I have explained:-
1) Matrix Multiplication
2) Matrix Chain Multiplication
3) Scalar Multiplication
4) Dynamic Programming
5) Time Complexity of Matrix Multiplication
6) Number of Scalar Multiplication…
Free Live Session on
Topic:- Bottom Up Approach of Matrix Chain Multiplication | Time And Space Complexity | Dynamic Programming
Date:-09.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/1PQbBsFCD3E
Topic:- Bottom Up Approach of Matrix Chain Multiplication | Time And Space Complexity | Dynamic Programming
Date:-09.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/1PQbBsFCD3E
YouTube
48 Bottom Up Approach of Matrix Chain Multiplication |Time And Space Complexity |Dynamic Programming
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Matrix Multiplication
2) Matrix Chain Multiplication
3) Scalar Multiplication
4) Dynamic Programming
5) Time Complexity and Space complexity of Matrix chain Multiplication…
In this video I have explained:-
1) Matrix Multiplication
2) Matrix Chain Multiplication
3) Scalar Multiplication
4) Dynamic Programming
5) Time Complexity and Space complexity of Matrix chain Multiplication…
Free Live Session on
Topic:- Longest Common Subsequence | Top Down And Bottom Up Dynamic Approach | Dynamic Programming | Complexity
Date:-11.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/_dBN7RY3ZXM
Topic:- Longest Common Subsequence | Top Down And Bottom Up Dynamic Approach | Dynamic Programming | Complexity
Date:-11.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/_dBN7RY3ZXM
YouTube
50 Longest Common Subsequence | Top Down And Bottom Up Approach | Dynamic Programming | Complexity
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) What is Subsequence
2) Example of Subsequence
3) Difference between Substring and subsequence
3) Algorithm to find longest common Subsequence
4) Time Complexity of longest…
In this video I have explained:-
1) What is Subsequence
2) Example of Subsequence
3) Difference between Substring and subsequence
3) Algorithm to find longest common Subsequence
4) Time Complexity of longest…
Free Live Session on
Topic:- Gate Previous Year Question on Longest Common Subsequence | Dynamic Approach | Algorithm
Date:-12.06.2021
Class Timing:-12.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/1IAICVhvc4c
Topic:- Gate Previous Year Question on Longest Common Subsequence | Dynamic Approach | Algorithm
Date:-12.06.2021
Class Timing:-12.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/1IAICVhvc4c
YouTube
51 Gate Previous Year Questions on Longest Common Subsequence | Dynamic Programming | Algorithm
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Gate Previous Year Questions on Longest Common Subsequence
2) Gate Previous Year Questions on Dynamic Programming
3) longest common subsequence gate questions
4) gate…
In this video I have explained:-
1) Gate Previous Year Questions on Longest Common Subsequence
2) Gate Previous Year Questions on Dynamic Programming
3) longest common subsequence gate questions
4) gate…
Free Live Session on
Topic:- Multistage Graph using Dynamic Programming and Greedy method | Characteristics | Time Complexity
Date:-13.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/QoNDXAZMqJk
Topic:- Multistage Graph using Dynamic Programming and Greedy method | Characteristics | Time Complexity
Date:-13.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/QoNDXAZMqJk
YouTube
53 Multistage Graph using Dynamic programming and Greedy method | Characteristic | Time Complexity
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) multistage graph using dynamic programming
2) multistage graph using dynamic programming in hindi
3) Characteristic of Multistage Graph
4) multistage graph using greedy…
In this video I have explained:-
1) multistage graph using dynamic programming
2) multistage graph using dynamic programming in hindi
3) Characteristic of Multistage Graph
4) multistage graph using greedy…
NIELIT Recruitment 2021 | Scientist B and Scientific Assistant A | PSU Job without GATE | Vacancy
https://youtu.be/WI5EqxF8Qoo
https://youtu.be/WI5EqxF8Qoo
YouTube
NIELIT Recruitment 2021 | Scientist B and Scientific Assistant A | PSU Job Without Gate | Vacancy
Welcome to Computer Science And IT Gate Coaching.
In this video I have discussed:-
1) NIELIT Recruitment of Scientist B and Scientific Assistant A
2) Vacancy of NIELIT Scientist B and Scientific Assistant A
3) Salary of NIELIT Scientist B and Scientific…
In this video I have discussed:-
1) NIELIT Recruitment of Scientist B and Scientific Assistant A
2) Vacancy of NIELIT Scientist B and Scientific Assistant A
3) Salary of NIELIT Scientist B and Scientific…
Free Live Session on
Topic:- 0/1 Knapsack Problem using Dynamic Programming | Why Greedy Method Fail ? | Time Complexity
Date:-14.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/vRwIA-iUW7k
Topic:- 0/1 Knapsack Problem using Dynamic Programming | Why Greedy Method Fail ? | Time Complexity
Date:-14.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/vRwIA-iUW7k
YouTube
54 : 0/1 Knapsack problem using dynamic programming | Why Greedy method fail ? | Time Complexity
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Difference between fractional and 0/1 Knapsack
2) Why Greedy method fails in 0/1 Knapsack
3) Substructure and recursive equation of 0/1 knapsack
4) Recursion tree and…
In this video I have explained:-
1) Difference between fractional and 0/1 Knapsack
2) Why Greedy method fails in 0/1 Knapsack
3) Substructure and recursive equation of 0/1 knapsack
4) Recursion tree and…
Free Live Session on
Topic:- Subset Sum Problem using Dynamic Programming | How Greedy Method Fail ? | Examples | Time Complexity
Date:-15.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/ZRkTDZFE2Zk
Topic:- Subset Sum Problem using Dynamic Programming | How Greedy Method Fail ? | Examples | Time Complexity
Date:-15.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/ZRkTDZFE2Zk
YouTube
54 Subset Sum Problem using Dynamic Programming | Why Greedy Method Fails? | Examples | Time Compl
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) Introduction to Subset Sum Problem?
2) How Greedy Method Fails in Subset Sum Problem?
3) Exhaustive Search of Subset Problem
4) Example of Subset Sum Problem
5) Time And…
In this video I have explained:-
1) Introduction to Subset Sum Problem?
2) How Greedy Method Fails in Subset Sum Problem?
3) Exhaustive Search of Subset Problem
4) Example of Subset Sum Problem
5) Time And…
Free Live Session on
Topic:- Travelling Salesman Problem using Dynamic Programming | Examples | Time And Space Complexity
Date:-16.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/vq_vEBlEmZY
Topic:- Travelling Salesman Problem using Dynamic Programming | Examples | Time And Space Complexity
Date:-16.06.2021
Class Timing:-6.00 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/vq_vEBlEmZY
YouTube
55 travelling salesman problem using dynamic programming | Example | Time And Space Complexity
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
Timetable:
0:48- Travelling salesman problem(TSP)
5:39- Statement of Travelling sales man (TSP)
7:28- Examples of TSP
12:56- Exhaustive search\Brute force method of traveling…
In this video I have explained:-
Timetable:
0:48- Travelling salesman problem(TSP)
5:39- Statement of Travelling sales man (TSP)
7:28- Examples of TSP
12:56- Exhaustive search\Brute force method of traveling…
Free Live Session on
Topic:- All Pair Shortest Path Floyd Warshall | Dynamic Programming | Code | Examples | Time And Space Complexity
Date:-17.06.2021
Class Timing:-6.15 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/xK3ShyYJQ7g
Topic:- All Pair Shortest Path Floyd Warshall | Dynamic Programming | Code | Examples | Time And Space Complexity
Date:-17.06.2021
Class Timing:-6.15 p.m
Join and Subscribe the Channel
Link:-
https://youtu.be/xK3ShyYJQ7g
YouTube
56 All Pair Shortest Path Floyd Warshall | Dynamic Programming | Code | Example | Time and Space
Welcome to Computer Science And IT Gate Coaching.
In this video I have explained:-
1) All Pair Shortest Path Floyd Warshall
2) all pair shortest path floyd warshall by using dynamic programming
3) Relationship between single source shortest path and all…
In this video I have explained:-
1) All Pair Shortest Path Floyd Warshall
2) all pair shortest path floyd warshall by using dynamic programming
3) Relationship between single source shortest path and all…