This channel provides educational content in simple and easy way with pdf and tutorial .

Unit 4.6 : Travelling salesman algorithm : | DAA:DSALGO:AKTU
17:36
Unit 4.6 : Travelling salesman algorithm : | DAA:DSALGO:AKTU
Unit 4.5 : Sum of Subset and Hamiltonion Circuit : | DAA:DSALGO:AKTU
24:28
Unit 4.5 : Sum of Subset and Hamiltonion Circuit : | DAA:DSALGO:AKTU
Unit 4.4 : Backtracking , N-Queens Problem , Graph Coloring : | DAA:DSALGO:AKTU
24:11
Unit 4.4 : Backtracking , N-Queens Problem , Graph Coloring : | DAA:DSALGO:AKTU
Unit 4.3 : Floyd Warshal algorithm : Design and Anaylysis of Algorithm| DAA:DSALGO:AKTU
19:34
Unit 4.3 : Floyd Warshal algorithm : Design and Anaylysis of Algorithm| DAA:DSALGO:AKTU
Unit 4.2 : 0/1 kanpsack problem | design and analysis of algorithm | DAA:DSALGO:AKTU
24:03
Unit 4.2 : 0/1 kanpsack problem | design and analysis of algorithm | DAA:DSALGO:AKTU
Unit 4.1 : Dynamic programming | design and analysis of algorithm | DAA:DSALGO:AKTU
36:33
Unit 4.1 : Dynamic programming | design and analysis of algorithm | DAA:DSALGO:AKTU
Unit 3.4:Dijikstra Algortihm and bellman ford Algorithm | DAA:DSALGO:AKTU
21:11
Unit 3.4:Dijikstra Algortihm and bellman ford Algorithm | DAA:DSALGO:AKTU
Unit 3.3:Fractional Knapsack problem | Prims algorithm | kruskal's Algorithm |BFS |DFS :DAA:AKTU
25:01
Unit 3.3:Fractional Knapsack problem | Prims algorithm | kruskal's Algorithm |BFS |DFS :DAA:AKTU
Unit 3.2:Kosaraju | Greedy Algorithm | Converx hull | Activity selection problem DAA:DSALGO:AKTU
21:45
Unit 3.2:Kosaraju | Greedy Algorithm | Converx hull | Activity selection problem DAA:DSALGO:AKTU
Unit 3.1:Divide & Conquer| Strassen's Matrix Multiplication |Graph Representation|BFS |DFS :DAA:AKTU
36:05
Unit 3.1:Divide & Conquer| Strassen's Matrix Multiplication |Graph Representation|BFS |DFS :DAA:AKTU
Unit 2.5:TriesList and SkipList : with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
20:13
Unit 2.5:TriesList and SkipList : with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
Unit 2.4:Complete Fibonocci Heap : with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
27:26
Unit 2.4:Complete Fibonocci Heap : with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
Unit 2.3:Complete Binomial Heap: with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
25:03
Unit 2.3:Complete Binomial Heap: with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
Unit 2.2:Complete B-Tree : with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
32:16
Unit 2.2:Complete B-Tree : with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
Unit 2.1:Complete Red Black Tree: with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
45:26
Unit 2.1:Complete Red Black Tree: with PDF Design and Analysis of Algorithm:DAA:DSALGO:AKTU
Unit 1.6: Linear Sorting|Counting Sort | Radix Sort | Bucket Sort : Design and Analysis of Algorithm
22:56
Unit 1.6: Linear Sorting|Counting Sort | Radix Sort | Bucket Sort : Design and Analysis of Algorithm
Unit 1.5 :MergeSort , HeapSort in Detail: Design and Analysis of Algorithm | dsalgo
49:33
Unit 1.5 :MergeSort , HeapSort in Detail: Design and Analysis of Algorithm | dsalgo
Unit 1.4 :Shell Sort , Quick Sort in Detail: Design and Analysis of Algorithm | dsalgo
39:54
Unit 1.4 :Shell Sort , Quick Sort in Detail: Design and Analysis of Algorithm | dsalgo
Unit 1.3 : Master theorem and Recursion Tree | Design and Analysis of Algorithm |daa | dsalgo
29:50
Unit 1.3 : Master theorem and Recursion Tree | Design and Analysis of Algorithm |daa | dsalgo
Unit 1.2 : Substitution Method : Recurrence Relation: Design and Analysis of Algorithm | dsalgo
28:28
Unit 1.2 : Substitution Method : Recurrence Relation: Design and Analysis of Algorithm | dsalgo
Unit 1.1 : Design and Analysis of Algorithm : Concepts, Complexity, and Performance | dsalgo
44:18
Unit 1.1 : Design and Analysis of Algorithm : Concepts, Complexity, and Performance | dsalgo
Unit 3: Constitution of India one shot | AKTU Syllabus | information about court system
1:17:25
Unit 3: Constitution of India one shot | AKTU Syllabus | information about court system
Unit 2: Constitution of India one shot | AKTU Syllabus | UNION & STATE EXECUTIVE
1:09:19
Unit 2: Constitution of India one shot | AKTU Syllabus | UNION & STATE EXECUTIVE
Unit 1: Constitution of India one shot | AKTU Syllabus | IFundamental Rights, Amendments, Power
1:34:02
Unit 1: Constitution of India one shot | AKTU Syllabus | IFundamental Rights, Amendments, Power
Unit3.1: Regular and Non-Regular Grammars:Theory of Automata and Formal Languages[TAFL]: AKTU:BTech
1:25:47
Unit3.1: Regular and Non-Regular Grammars:Theory of Automata and Formal Languages[TAFL]: AKTU:BTech
Unit2.2: Regular Expressions and Languages:Theory of Automata and Formal Languages[TAFL]: AKTU:BTech
44:49
Unit2.2: Regular Expressions and Languages:Theory of Automata and Formal Languages[TAFL]: AKTU:BTech
Unit2.1: Regular Expressions and Languages:Theory of Automata and Formal Languages[TAFL]: AKTU:BTech
1:02:26
Unit2.1: Regular Expressions and Languages:Theory of Automata and Formal Languages[TAFL]: AKTU:BTech
Unit1.2: Basic Concepts & Automata Theory:Theory of Automata and Formal Languages[TAFL]: AKTU:BTech
1:09:43
Unit1.2: Basic Concepts & Automata Theory:Theory of Automata and Formal Languages[TAFL]: AKTU:BTech
Python Unit 5: Numpy , Pandas , Matplotlib, GUI , TKINTER.#aktu #dsalgo #btech 2nd
1:11:07
Python Unit 5: Numpy , Pandas , Matplotlib, GUI , TKINTER.#aktu #dsalgo #btech 2nd
OOP with Java Unit 5 Oneshot | Complete Guide to spring Framework and spring boot |AKTU
1:54:00
OOP with Java Unit 5 Oneshot | Complete Guide to spring Framework and spring boot |AKTU