- 152
- 1 040 104
Data Structures & Algorithms by Girish Rao Salanke
India
Приєднався 7 вер 2020
This channel is for all those who are interested in exploring the concepts of Data Structures & Algorithms.
Відео
32 Solving Modular Linear equation using Extended Euclid's Algorithm
Переглядів 4,5 тис.3 роки тому
32 Solving Modular Linear equation using Extended Euclid's Algorithm
42 1 Memory Function Knapsack Problem
Переглядів 13 тис.3 роки тому
42 1 Memory Function Knapsack Problem
56 Travellig Salesman Problem using Branch & Bound
Переглядів 20 тис.3 роки тому
56 Travellig Salesman Problem using Branch & Bound
55 Knapsack Problem using Branch & Bound
Переглядів 17 тис.3 роки тому
55 Knapsack Problem using Branch & Bound
54 Assignment Problem using Branch & Bound
Переглядів 16 тис.3 роки тому
54 Assignment Problem using Branch & Bound
29 Fibonacci Heap 1 - Introduction & Insertion
Переглядів 3,3 тис.3 роки тому
29 Fibonacci Heap 1 - Introduction & Insertion
52 C Program to Solve Sum of Subset Problem using Backtracking
Переглядів 11 тис.3 роки тому
52 C Program to Solve Sum of Subset Problem using Backtracking
51 Sum of Subset Problem - Back Tracking
Переглядів 13 тис.3 роки тому
51 Sum of Subset Problem - Back Tracking
27 Binomial Heap 1 - Introduction & Properties
Переглядів 2,7 тис.3 роки тому
27 Binomial Heap 1 - Introduction & Properties
49 C Program to implment Dijkstra's Algorithm to find shortest path from a given source vertex
Переглядів 32 тис.3 роки тому
49 C Program to implment Dijkstra's Algorithm to find shortest path from a given source vertex
26 Bipartite Graph and Maximum Matching in Bipartite Graph
Переглядів 7 тис.3 роки тому
26 Bipartite Graph and Maximum Matching in Bipartite Graph
48 Dijkstra's Algorithm Single Source Shortest Path
Переглядів 15 тис.3 роки тому
48 Dijkstra's Algorithm Single Source Shortest Path
47 Kruskal's Algorithm to find Minimum Spanning Tree
Переглядів 13 тис.3 роки тому
47 Kruskal's Algorithm to find Minimum Spanning Tree
43 C Program to Solve Knapsack Problem using Dynamic Programming
Переглядів 6 тис.3 роки тому
43 C Program to Solve Knapsack Problem using Dynamic Programming
46 C Program to find Minimum Spanning Tree using Prims Algorithm
Переглядів 37 тис.3 роки тому
46 C Program to find Minimum Spanning Tree using Prims Algorithm
45 Introduction to Greedy Technique & Prims Algorithm to find MST
Переглядів 13 тис.3 роки тому
45 Introduction to Greedy Technique & Prims Algorithm to find MST
24 Ford Fulkerson Algorithm to find max flow in a flow network
Переглядів 8 тис.3 роки тому
24 Ford Fulkerson Algorithm to find max flow in a flow network
23 Introduction to Max Flow & its Terminologies
Переглядів 4 тис.3 роки тому
23 Introduction to Max Flow & its Terminologies
tu haai toh dill dhadktaa hai🤌 What an explanation!
thank you sir for these videos
Indebted to you forever , thank you 🛐
Sir give me the link of the notes sir 🙏
L is not mentioned in the algo to be able to swap A[L] at 28:15
Tomorrow is my daa exam and this guy single handedly saved me. Thanks man appreciate it.
its ada right?
@@__user_90hmm now for exam remaining time is 4: 30 hrs
@@Vikramaditya_108 haha
@@__user_90today's paper was mostly similar to model question paper and even bad daa something question was also there which was already explained Girish sir in his videos.😄
Thank you sir
Sir pls make lectures on networks and toc🙏🙏🙏
Jai Hind Jai karnataka jai kannada ❤
Such a wonderful lecturer 😊
❤
Thank you for the beautiful class sir ❤
You are amazing sir ❤ wish I had u as my teacher ❤😢
@@Sanjana_Dhananjaya thank you sanjana for your wonderful words.
nice sir
best explanation in youtube amazing keep up the good work
Nyc explanation sir🙏
why was d not considered
sir your lecture helping me a lot wonderful teaching style
Thank you
sir P, NP, and NP-Complete Problems, please
reply your mail-id , i will share the notes
thank you sir
thank u sir 👍
Thank you so much sir it was very helpful
Global academy of Technology
Sir can you please send notes for analysis and design algorithm for studying for vtu?? you can upload to google drive and send link here sir btw u r very good teacher thank you sir
Send a mail to girishraosalanke@gmail.com, I will send notes
amazing lecture❤❤❤
Thank you! 🙂
Nice ✨
Thnx a lot sir , tqu soo much sir for ur videos really helpfull sir 👏🏻👏🏻👏🏻☺️☺️☺️☺️☺️☺️☺️☺️☺️☺️☺️🙌❤️
Nice
Sir start to make videos agin
Love from RV college of engg
😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊
❤
Thank you sir
I understood easily thank you for explanation sir.do some more videos 😊
super sir🤝
very well explained sir💥
Thank you sir 😍,jai kannada
Thank you sir 👍❤😢
Life saver ❤
Are these playlist sufficient for vtu exams ?
Yes
Legend teacher saving my semester 🙏🙏🙏 thanks for giving these for free
Great explaination!!!
What we have to do if it is not in topological sort??
Great explanation
BRILLIANT SIR . I DONT HAVE WORDS HOW MUCH EASILY I UNDERSTOOD THIS GREAT SIR 😍
Is it n-2 or n-1 in algorithm
9:16 in example 6 while(n>0) { basic operation n=n/2; } this will be infinite loop , right ? because n will always be positive ? this algorithm has no finiteness how come time complexity is log2n ?
The size of the problem(n) is reduced by half in each iteration. Over the time, the value of n will be zero and the while condition will be false.
Very good explanaation sir 🎉may god bless you 🙏
8:32 sir c and cpp is faster than python i read it somewhere sir
Thank you Sir,for explaining 2-3 tree with example😊👍