Bank Exams
Free courses
Quantitative Aptitude
Basic Maths
Lesson 4 of 5 • 2 upvotes • 11:11mins
In this video I discussed one problem which is based on traveling salesman using dynamic programming
5 lessons • 52m
Knapsack Problem and Job Sequencing Greedy Method
9:24mins
Prims and Kruskals Algorithms
9:11mins
Multistage Graph using Backtracking
11:19mins
Traveling Salesman using Dynamic Programming
11:11mins
Knapsack using Dynamic and Branch and Bound
11:51mins