Design and Analysis of algorithms (DAA) (English)

Wednesday, November 29, 2023

Starting a new Lecture Notes Series on Design and Analysis of algorithms (DAA)

Youtube Lecture Playlist Credits
Channel Name: Education 4u

So Let Us Start to This Journey of Learning

Design and Analysis of algorithms (DAA) By Lecture Notes together!

Lecture Description of this above Topic:

Lecture 1: Algorithm introduction | Design & Algorithms | Lec-1

Lecture 2: space complexity | Design & Algorithms | Lec-2

Lecture 3: time complexity

Lecture 4: pseudo code | Sequence & Selection logic | Part-1/2 | Design & Algorithms | Lec-4

Lecture 5: pseudo code | Iteration logic | Part-2/2 | Design & Algorithms | Lec-5

Lecture 6: Asymptotic notation | Design & Algorithms | Lec-6

Lecture 7: asymptotic growth | Design & Algorithms | Lec-7

Lecture 8: Asymptotic notation | Theta notation | Design & Algorithms | Lec-8

Lecture 9: Asymptotic notation | Big-O notation | Design & Algorithms | Lec-9

Lecture 10: Asymptotic notation | Big omega, little oh & omega | Design & Algorithms | Lec-10

Lecture 11: divide and conquer algorithm | Design & Algorithms | Lec-11

Lecture 12: Binary Search Algorithm | Design & Algorithms | Lec-12

Lecture 13: Binary Search examples | Successful search | Design & Algorithms | Lec-13

Lecture 14: Binary Search Examples | Unsuccessful search | Design & Algorithms | Lec-14

Lecture 15: merge sort algorithm

Lecture 16: Merge sort example | Design & Algorithms | Lec-16

Lecture 17: Quicksort algorithm | Partition | Part-1/2 | Design & Algorithms | Lec-17

Lecture 18: Quicksort algorithm| Example | Part - 2/2 | Design & Algorithms | Lec-18

Lecture 19: Matrices multiplication | basic | Design & Algorithms | Lec-19

Lecture 20: Divide and Conquer | Matrix Multiplication | Design & Algorithms | Lec-20

Lecture 21: Strassen's algorithm | Matrix multiplication | Design & Algorithms | Lec-21

Lecture 22: Binary Search Tree | BST | Design & Algorithms | Lec-22

Lecture 23: Binary Search Tree traversal | Design & Algorithms | Lec-23

Lecture 24: BST traversal | In, Pre & Post order | Examples | Design & Algorithms | Lec-24

Lecture 25: Spanning Tree | Design & Algorithms | Lec-25

Lecture 26: Prim's algorithm | Minimum Spanning tree (MST) | Design & Algorithms | Lec-26

Lecture 27: Krushkal's algorithm | Minimum Spanning Tree (MST) | Design & Algorithms | Lec-27

Lecture 28: Prim's and Krushkal's algorithm | MST | Differences | Design & Algorithms | Lec-28

Lecture 29: Breadth First Search algorithm | BFS | Design & Algorithms | Lec-29

Lecture 30: Breadth First Search | BFS examples | Design & Algorithms | Lec-30

Lecture 31: Depth First Search | DFS | Graph traversal | Design & Algorithms | Lec-31

Lecture 33: AND/OR graph | Design & Algorithms | Lec-33

Lecture 34: Connected Components | Graph | Design & Algorithms | Lec-34

Lecture 35: Biconnected Components| Graph | Design & Algorithms | Lec-35

Lecture 36: dijkstra's shortest path algorithm

Lecture 37: bellman ford shortest path algorithm

Lecture 38: Greedy Method | Design & Algorithms | Lec-38

Lecture 39: Job sequencing problem with deadline | Greedy Method | Design & Algorithms | Lec-39

Lecture 40: Minimum Cost Spanning Tree | Krushkal's & Prim's | Design & Algorithms | Lec-40

Lecture 41: Minimum Cost Spanning Tree | Example | Krushkal's Prim's | Design Algorithms | Lec-41

Lecture 42: Dynamic programming | Design & Algorithms | Lec-42

Lecture 43: Matrix Chain Multiplication | Dynamic Programming | Design & Algorithms | Lec-43

Lecture 44: matrix chained multiplication

Lecture 45: All pairs Shortest Path Algorithm | Dynamic programming | Design & Algorithms | Lec-45

Lecture 46: All pairs Shortest path Algorithm | Example | Dynamic | Design & Algorithms | Lec-46

Lecture 47: 0/1 knapsack problem | Dynamic Programming | Design & Algorithms | Lec-47

Lecture 48: 0/1 knapsack problem | example

Lecture 49: Traveling Salesman Problem | Part-1/3 | Dynamic program | Design & Algorithms | Lec-49

Lecture 50: Traveling Salesman Problem | Part-2/3 | Dynamic program | Design & Algorithms | Lec-50

Lecture 51: Traveling Salesman Problem | Part-3/3 | Dynamic program | Design & Algorithms | Lec-51

Lecture 52: Backtracking general method | Design & Algorithms | Lec-52

Lecture 53: N Queen Problem | Backtracking Algorithm | Design & Algorithms | Lec-53

Lecture 54: Sum of Subset Problem | Backtracking Method | Design & Algorithms | Lec-54

Lecture 55: hamiltonian circuit problem using backtracking