- 33
- 182 463
MRV Tutorials
United States
Registrace 2. 08. 2020
Introduction to C Programming | History & Features | C for Beginners
This is the first video in the C programming for Beginners. The purpose i have made this video series is to get started with programming much easier way. Since most of the programming languages have a common syntax, i thought of starting with C and moving further.
Please go through the video completely and provide your valuable suggestions in the comments below.
Thank you.
Please go through the video completely and provide your valuable suggestions in the comments below.
Thank you.
zhlédnutí: 95
Video
Traveling Salesman Problem | How to solve it using Branch & Bound Technique
zhlédnutí 1,9KPřed 3 lety
We will be looking at this topic n subjects like Design and analysis of algorithm, graph theory and data structures. Here in this video i shall cover step by step working procedure of sequential search and we shall look at the algorithm for it. Go through the content and feel free to contact me through the following mail id. thezensloth@gmail.com Thank you.
Knapsack Problem | How to solve it using Branch and Bound Technique?
zhlédnutí 3,4KPřed 3 lety
We will be looking at this topic n subjects like Design and analysis of algorithm, graph theory and data structures. Here in this video i shall cover step by step working procedure of sequential search and we shall look at the algorithm for it. Go through the content and feel free to contact me through the following mail id. thezensloth@gmail.com Thank you.
Assignment Problem | How to solve it using Branch & Bound Technique
zhlédnutí 1,2KPřed 3 lety
We will be looking at this topic n subjects like Design and analysis of algorithm, graph theory and data structures. Here in this video i shall cover step by step working procedure of sequential search and we shall look at the algorithm for it. Go through the content and feel free to contact me through the following mail id. thezensloth@gmail.com Thank you.
Sum of Subsets Problem | How to solve it using Backtracking Approach
zhlédnutí 530Před 3 lety
We will be looking at this topic n subjects like Design and analysis of algorithm, graph theory and data structures. Here in this video i shall cover step by step working procedure of sequential search and we shall look at the algorithm for it. Go through the content and feel free to contact me through the following mail id. thezensloth@gmail.com Thank you.
N Queen's Problem | How to solve it using Backtracking Method?
zhlédnutí 705Před 3 lety
We will be looking at this topic n subjects like Design and analysis of algorithm, graph theory and data structures. Here in this video i shall cover step by step working procedure of sequential search and we shall look at the algorithm for it. Go through the content and feel free to contact me through the following mail id. thezensloth@gmail.com Thank you.
Hamiltonian Circuit Problem | How to solve it using Backtracking approach?
zhlédnutí 869Před 3 lety
We will be looking at this topic n subjects like Design and analysis of algorithm, graph theory and data structures. Here in this video i shall cover step by step working procedure of sequential search and we shall look at the algorithm for it. Go through the content and feel free to contact me through the following mail id. thezensloth@gmail.com Thank you.
Stable Marriage Problem | How to solve it using Iterative Improvement
zhlédnutí 8KPřed 3 lety
Stable Marriage Problem | How to solve it using Iterative Improvement
Maximum Matching | How to solve it using Iterative Improvement
zhlédnutí 1,4KPřed 3 lety
Maximum Matching | How to solve it using Iterative Improvement
Maximum Flow Problem | How to solve it using Iterative Improvement?
zhlédnutí 2,3KPřed 3 lety
Maximum Flow Problem | How to solve it using Iterative Improvement?
How to solve Assignment Problem using Exhaustive Search | Brute Force
zhlédnutí 23KPřed 3 lety
How to solve Assignment Problem using Exhaustive Search | Brute Force
How to solve Knapsack Problem using Exhaustive Search | Brute Force
zhlédnutí 29KPřed 3 lety
How to solve Knapsack Problem using Exhaustive Search | Brute Force
How to solve Traveling Salesman Problem using Exhaustive search | Brute Force
zhlédnutí 33KPřed 3 lety
How to solve Traveling Salesman Problem using Exhaustive search | Brute Force
Closest Pair Problem | How to identify the closest set of points? | Brute Force
zhlédnutí 19KPřed 3 lety
Closest Pair Problem | How to identify the closest set of points? | Brute Force
Brute Force - String Matching | How String Matching Algorithm?
zhlédnutí 29KPřed 3 lety
Brute Force - String Matching | How String Matching Algorithm?
Prim's Algorithm | Finding minimum spanning tree | Greedy technique
zhlédnutí 426Před 3 lety
Prim's Algorithm | Finding minimum spanning tree | Greedy technique
Floyd's Algorithm | Identify the all pair shortest path | Dynamic Programming
zhlédnutí 771Před 3 lety
Floyd's Algorithm | Identify the all pair shortest path | Dynamic Programming
Warshall's Algorithm | Identify transitive closure | Dynamic Programming
zhlédnutí 2,2KPřed 3 lety
Warshall's Algorithm | Identify transitive closure | Dynamic Programming
Kruskal's Algorithm | Finding Minimum Spanning Tree | Greedy Technique
zhlédnutí 415Před 3 lety
Kruskal's Algorithm | Finding Minimum Spanning Tree | Greedy Technique
How Selection Sort works? | The easiest sorting algorithm | Brute Force
zhlédnutí 1,9KPřed 3 lety
How Selection Sort works? | The easiest sorting algorithm | Brute Force
How Quick Sort works? | The quickest conventional sorting algorithm | Divide & Conquer
zhlédnutí 1,5KPřed 3 lety
How Quick Sort works? | The quickest conventional sorting algorithm | Divide & Conquer
How Merge Sort works? | A simple Divide and Conquer strategy to sort a list
zhlédnutí 1,3KPřed 3 lety
How Merge Sort works? | A simple Divide and Conquer strategy to sort a list
How Insertion Sort works ? | A simple Decrease and Conquer Strategy for sorting a list
zhlédnutí 3,5KPřed 3 lety
How Insertion Sort works ? | A simple Decrease and Conquer Strategy for sorting a list
How Bubble Sort works? | A simple Brute Force technique to sort a list
zhlédnutí 1,6KPřed 3 lety
How Bubble Sort works? | A simple Brute Force technique to sort a list
BINARY SEARCH ALGORITHM | A step by step working procedure with example
zhlédnutí 597Před 3 lety
BINARY SEARCH ALGORITHM | A step by step working procedure with example
Linear Search Algorithm | Step by step working procedure of sequential search
zhlédnutí 1,8KPřed 3 lety
Linear Search Algorithm | Step by step working procedure of sequential search
Thankyou sir i understand clearly 😊
Thank you
Very useful.@3:10 when talking about interpretation error, the slide has text age 'can' be greater than 120 instead 'cant'.its an interpretation error itself😂
Please enable the download option 😢
end wla step to pela hai bhai
wah bhai tyt
nice explanation sir
The best explanation for any topic
Best explanation... The most underrated channel on CZcams for tech
Good tutoirals bro carry on
Bro R3 wrong
Well done ✅
Anyone from CSE D?...
🙄🙄
No bro I’m from cse C
Nanba o nanba .... Padikkuriya nu keta , illa macha , pubg aaduren nu soltu , ears la ootha nanba .... Perumaiya irukku
Annaikku poota commend da...😂@@veshala9108
@@shrishw.n2308intha oora yemathalam.. Ulagatha yemathalam... Aana yenna yematha mudiyathu...💀
Devru ninge olled maadlappa❤😊
Useful! ❤
Easy to understand, thank you Sir,
Here max weight will be given or taken by us
Azxxv8 9 9bb ha hu😊
Sir this makes confusion for us please do any way to understand... Explanation was good
Nice
Super dear❤
Underratted sir 😢
I have an exam tomorrow and I'm here exploring ur videos and realizing that my teacher told the same thing in the class which means she also watched ur videos😂😅
How was ur exam?
Nice bro
Thank you❤
Thanks... 🙏❤️
Thanks a lot... You explained very well❤️🙏❤️
what does t(i+j) means?
Your other videos have been good. But for this particular video you gave an extremely poor explanation.
thank youuu
thanks a lot. it really helped me in my last minute prep!
Sir that was a great explaination but there's a small mistake while adding 9+4+1=14 but it's written 15 apart from that everything is absolutely fine.
gr8 video but if same kind of situation with bigger matrix then it will be at time expense. Will backtrack work efficiently on very big matrix?
This is one way to solve and thank you so very much, you explain it in a way even a layman can understand it. Marvelous.
Thanks vro
Thanks 👍🏻👍🏻👍🏻👍🏻☺️
Awesome explanation bro
sum of work time is wrong, else good explanation
great explanation
Really helpful thank you 😊
Hindi ma bol
Great video
Setting up research goal and retrieving data explanation is start in 4:20
So, this one is Exhaustive optimization not Exhaustive because you are chosing the optimal solution
Thank you so much
hello sir i dont know weather you are active in this chanel or not all these videos are uploaded one year ago but honestly speaking your videos are helping me a lot now and very easy to understand compared to others thank you
Great explanation 👍
ty bro
good explanation sir
will the women optimality give the same result?
No