Starting a new Lecture Notes Series on DAA Aktu Previous years question//B.Tech /B.voc/BCA//Design and analysis of algorithms
%20(6).png)
%20(6).png)
Youtube Lecture Playlist CreditsChannel Name: Coder Army
So Let Us Start to This Journey of Learning
DAA Aktu Previous years question//B.Tech /B.voc/BCA//Design and analysis of algorithms By Lecture Notes together!
Lecture 5: #5 merge sort//algorithm with examples(easy explanation) //AKTU previous years question //DAA//
Lecture 9: #8 Red-Black tree (insertion and deletion) //DAA most important question//AKTU previous years ques
Lecture 10: #9 Binomial heap (properties, Binomial tree, union, insertion, deletion) one shot//DAA AKTU pyq
Lecture 11: #10 Convex hull(Graham-Scan algorithm)//DAA//AKTU Previous years question//@brevilearning
Lecture 13: #12 Kruskal's and Prim's algorithm implementation (ONE-SHOT) //DAA AKTU Previous years question.
Lecture 14: #13 Dijkastra's/greedy single source shortest path algorithm//DAA AKTU previous years question.
Lecture 19: #17 Hamiltonian cycle (full explanation with example) //DAA AKTU previous years question.
Lecture 21: #19 Knuth Morris Pratt algorithm for string matching//DAA//AKTU previous years question.