Design and Analysis of Algorithms free videos and free material uploaded by Nagaraju Thatha .
Syllabus / What will i learn?
Curriculum for this course
24 Lessons
05:51:20 Hours
Algorithm Introduction and Process
1 Lessons
- Algorithm Introduction and Process Video 00:08:14
Pseduo Code Conventions
1 Lessons
- Pseduo Code Conventions Video 00:07:06
Performance Measurement -Time Complexity with Examples
1 Lessons
- Performance Measurement -Time Complexity with Examples Video 00:17:16
Space Complexity with Examples
1 Lessons
- Space Complexity with Examples Video 00:09:22
Asymptotic Notations- Design and Analysis of Algorithms
1 Lessons
- Asymptotic Notations- Design and Analysis of Algorithms Video 00:10:03
Divide and Conquer - Binary Search
1 Lessons
- Divide and Conquer - Binary Search Video 00:08:17
Merge Sort-Divide and Conquer
1 Lessons
- Merge Sort-Divide and Conquer Video 00:21:03
Quick Sort-Divide and Conquer
1 Lessons
- Quick Sort-Divide and Conquer Video 00:15:56
Introduction to Greedy Method and Knapsack Problem Using Greedy
1 Lessons
- Introduction to Greedy Method and Knapsack Problem Using Greedy Video 00:09:30
Job Sequencing with Dead Lines
1 Lessons
- Job Sequencing with Dead Lines Video 00:07:44
Dijkstra's Single Source Shortest Path Problem Using Greedy Method
1 Lessons
- Dijkstra's Single Source Shortest Path Problem Using Greedy Method Video 00:09:28
Minimum Cost Spanning Tree
1 Lessons
- Minimum Cost Spanning Tree Video 00:13:14
Knapsack Problem Using Dynamic Programming with Example
1 Lessons
- Knapsack Problem Using Dynamic Programming with Example Video 00:19:04
Optimal Binary Search Tree with Example Using Dynamic Programming- Algorithms
1 Lessons
- Optimal Binary Search Tree with Example Using Dynamic Programming- Algorithms Video 00:31:43
Travelling Sales Man Problem - Dynamic Programming with Example
1 Lessons
- Travelling Sales Man Problem - Dynamic Programming with Example Video 00:16:44
All Pairs Shortest Path with Example By Dynamic Programming
1 Lessons
- All Pairs Shortest Path with Example By Dynamic Programming Video 00:15:57
N Queens Problem by Using Back Tracking
1 Lessons
- N Queens Problem by Using Back Tracking Video 00:12:35
Sum of Sub Sets Problem
1 Lessons
- Sum of Sub Sets Problem Video 00:10:06
Graph Coloring
1 Lessons
- Graph Coloring Video 00:08:23
Hamiltonian Cycle
1 Lessons
- Hamiltonian Cycle Video 00:10:46
Knapsack Problem Using FIFO Branch and Bound
1 Lessons
- Knapsack Problem Using FIFO Branch and Bound Video 00:22:40
Knapsack Problem Using Least Cost Branch and Bound
1 Lessons
- Knapsack Problem Using Least Cost Branch and Bound Video 00:20:37
Travelling Sales Person Problem Using Least Cost Branch and Bound
1 Lessons
- Travelling Sales Person Problem Using Least Cost Branch and Bound Video 00:26:13
Master Theorem to Solve Recurrence Relations with Examples
1 Lessons
- Master Theorem to Solve Recurrence Relations with Examples Video 00:19:19
+ View more
Description
You need online training / explanation for this course?
1 to 1 Online Training contact instructor for demo :
+ View more
Other related courses
Updated Wed, 22-Apr-2020
Updated Wed, 24-Feb-2021
Updated Wed, 22-Apr-2020
Updated Thu, 30-Apr-2020
About the instructor
- 1 Reviews
- 11 Students
- 16 Courses
Student feedback
Reviews
Write a public review