×
Create CV Books Summaries Online Courses Blog Communities

Login

Sign up
MindLuster Logo
Categories
Recent

Design and Analysis of algorithms DAA

Programming

Register in this Course

Algorithm introduction | Design Algorithms | Lec 1 | Bhanu Priya

space complexity | Design Algorithms | Lec 2 | Bhanu Priya

time complexity | Algorithms Design and Analysis

pseudo code | Sequence Selection logic | Part 1 2 | Design Algorithms | Lec 4 | Bhanu Priya

pseudo code | Iteration logic | Part 2 2 | Design Algorithms | Lec 5 | Bhanu Priya

Asymptotic notation | Design Algorithms | Lec 6 | Bhanu Priya

asymptotic growth | Design Algorithms | Lec 7 | Bhanu Priya

Asymptotic notation | Theta notation | Design Algorithms | Lec 8 | Bhanu Priya

Asymptotic notation | Big O notation | Design Algorithms | Lec 9 | Bhanu Priya

Asymptotic notation | Big omega little oh omega | Design Algorithms | Lec 10 | Bhanu Priya

divide and conquer algorithm | Design Algorithms | Lec 11 | Bhanu Priya

Binary Search Algorithm | Design Algorithms | Lec 12 | Bhanu Priya

Binary Search examples | Successful search | Design Algorithms | Lec 13 | Bhanu Priya

Binary Search Examples | Unsuccessful search | Design Algorithms | Lec 14 | Bhanu Priya

merge sort algorithm

Merge sort example | Design Algorithms | Lec 16 | Bhanu Priya

Quicksort algorithm | Partition | Part 1 2 | Design Algorithms | Lec 17 | Bhanu Priya

Quicksort algorithm| Example | Part 2 2 | Design Algorithms | Lec 18 | Bhanu Priya

Matrices multiplication | basic | Design Algorithms | Lec 19 | Bhanu Priya

Divide and Conquer | Matrix Multiplication | Design Algorithms | Lec 20 | Bhanu Priya

2.9 Strassens Matrix Multiplication

Binary Search Tree | BST | Design Algorithms | Lec 22 | Bhanu Priya

Binary Search Tree traversal | Design Algorithms | Lec 23 | Bhanu Priya

BST traversal | In Pre Post order | Examples | Design Algorithms | Lec 24 | Bhanu Priya

Spanning Tree | Design Algorithms | Lec 25 | Bhanu Priya

Prim s algorithm | Minimum Spanning tree MST | Design Algorithms | Lec 26 | Bhanu Priya

Krushkal s algorithm | Minimum Spanning Tree MST | Design Algorithms | Lec 27 | Bhanu Priya

Prim s and Krushkal s algorithm | MST | Differences | Design Algorithms | Lec 28 | Bhanu Priya

Breadth First Search algorithm | BFS | Design Algorithms | Lec 29 | Bhanu Priya

Breadth First Search | BFS examples | Design Algorithms | Lec 30 | Bhanu Priya

Depth First Search | DFS | Graph traversal | Design Algorithms | Lec 31 | Bhanu Priya

Depth First Search | DFS | Examples | Graph traversal | Design Algorithms | Lec 32 | Bhanu Priya

AND OR graph | Design Algorithms | Lec 33 | Bhanu Priya

Connected Components | Graph | Design Algorithms | Lec 34 | Bhanu Priya

Biconnected Components| Graph | Design Algorithms | Lec 35 | Bhanu Priya

Dijkstras Shortest Path Algorithm Explained | With Example

bellman ford shortest path algorithm | DAA |

Greedy Method | Design Algorithms | Lec 38 | Bhanu Priya

Job sequencing problem with deadline | Greedy Method | Design Algorithms | Lec 39 | Bhanu Priya

Minimum Cost Spanning Tree | Krushkal s Prim s | Design Algorithms | Lec 40 | Bhanu Priya

Minimum Cost Spanning Tree | Example | Krushkal s Prim s | Design Algorithms | Lec 41 | Bhanu Priya

Dynamic programming | Design Algorithms | Lec 42 | Bhanu Priya

Matrix Chain Multiplication | Dynamic Programming | Design Algorithms | Lec 43 | Bhanu Priya

matrix chained multiplication | Dynamic programming |examples |

All pairs Shortest Path Algorithm | Dynamic programming | Design Algorithms | Lec 45 | Bhanu Priya

All pairs Shortest path Algorithm | Example | Dynamic | Design Algorithms | Lec 46 | Bhanu Priya

0 1 knapsack problem | Dynamic Programming | Design Algorithms | Lec 47 | Bhanu Priya

0 1 knapsack problem | example| dynamic programming

Traveling Salesman Problem | Part 1 3 | Dynamic program | Design Algorithms | Lec 49 | Bhanu Priya

Traveling Salesman Problem | Part 2 3 | Dynamic program | Design Algorithms | Lec 50 | Bhanu Priya

Traveling Salesman Problem | Part 3 3 | Dynamic program | Design Algorithms | Lec 51 | Bhanu Priya

Backtracking general method | Design Algorithms | Lec 52 | Bhanu Priya

N Queen Problem | Backtracking Algorithm | Design Algorithms | Lec 53 | Bhanu Priya

Sum of Subset Problem | Backtracking Method | Design Algorithms | Lec 54 | Bhanu Priya

hamiltonian circuit problem using backtracking

We Appreciate Your Feedback

Excellent
1466 Reviews
Good
1157 Reviews
medium
76 Reviews
Acceptable
16 Reviews
Not Good
9 Reviews
4.5
2724 Reviews
BASANABOINA PRAVEEN KUMAR 

GOOD
2026-04-13

Laxman Kumavath 

wifn
2026-04-13

SRI SAI TEJA REDDY KUKUDALA 

good
2026-04-13

METTU DHEERAJ REDDY 

gooodd
2026-04-13

Ramidi Meghana 

good
2026-04-12

PEYYALA NAVYA 

excellent delivery
2026-04-12

NAMPALLY ROHITH REDDY 

nice
2026-04-12

Priya darshini Challa 

Good
2026-04-12

Ganji Vinay 

very useful course
2026-04-11

KESANI SNEHITHA REDDY 

..
2026-04-11

Ritika Sharma 

It was too much time
2026-04-11

ABHINAV DEVARAYAPALLI 

it was easy to understand
2026-04-11

Show More Reviews

Another Programming Courses

React Projects Workshops
33 Lessons

React Projects Workshops

Node js back end JavaScript
34 Lessons

Node js back end JavaScript

Python programming language
15 Lessons

Python programming language

Social Network Theme UI With Sass
4 Lessons

Social Network Theme UI With Sass

Full Stack React Django
7 Lessons

Full Stack React Django

Build a Node js App With Sequelize
3 Lessons

Build a Node js App With Sequelize

GraphQL With React Apollo
4 Lessons

GraphQL With React Apollo

Node js REST API With Restify Mongoose JWT
2 Lessons

Node js REST API With Restify Mongoose JWT

Show More Course for Programming

Design and Analysis of Algorithm help to design the algorithms for solving different types of problems in Computer Science. It also helps to design and analyze the logic on how the program will work before developing the actual code for a program .

Trends
Recent
Java programming easily