238 подписчиков
33 видео
NP Hard & NP Complete classes | Design and Analysis Of Algorithm (DAA) | IPU | Unit-4 |
Polynomial & Non-Polynomial Complexity | Design and Analysis Of Algorithm (DAA) | IPU | Unit-4
Knuth Morris Pratt Algorithm | Design and Analysis Of Algorithm (DAA) | IPU | Unit-4 |
String Matching Using Finite Automata | Design and Analysis Of Algorithm (DAA) | IPU | Unit-4 |
The Rabin-Karp Algorithm | Design and Analysis Of Algorithm (DAA) | IPU | Unit-4 |
Naive String Matching Algorithm | Design and Analysis Of Algorithm (DAA) | IPU | Unit 4|
Travelling Salesman Problem (Branch & Bound) Part 2 | Design and Analysis Of Algorithm (DAA)| Unit 3
Travelling Salesman Problem (Branch & Bound) Part1 | Design and Analysis Of Algorithm (DAA) | Unit 3
0/1 Knapsacks Problem (Branch & Bound) | Design and Analysis Of Algorithm (DAA) | Unit 3
Branch and Bound Methods | Dynamic programming | Design and Analysis Of Algorithms (DAA) | Unit 3
Floyd Warshall Algorithm | Dynamic programming | Design and Analysis Of Algorithms (DAA)| Unit 3
Travelling Salesman Problem | Dynamic programming | Design and Analysis Of Algorithms (DAA)| Unit 3
Web Technologies (CIE-356T) | Syllabus Discussion and Description | IPU | Unit 1,2,3,4
