AL-402 Analysis & Design of Algorithms Notes
5 notes for Analysis & Design of Algorithms, unit by unit.
Notes for AL-402
- Unit 1 · Short notes Definitions of algorithms and complexity Definitions of algorithms and complexity · Time and Space Complexity · Time–space tradeoff · Various bounds on complexity · Asymptotic notation · Recurrences and recurrence solving techniques
- Unit 2 · Short notes Greedy strategy and its applications Study of Greedy strategy · Optimal merge patterns · Huffman coding · Minimum spanning trees · Knapsack problem · Job sequencing with deadlines
- Unit 3 · Short notes Dynamic programming Concept of dynamic programming · 0/1 knapsack problem (dynamic programming solution) · Multistage graph problem · Reliability design using dynamic programming · Floyd‑Warshall algorithm
- Unit 4 · Short notes Backtracking, branch & bound and parallel algorithms Backtracking concept · 8‑queen’s problem · Hamiltonian cycle problem · Graph colouring problem · Introduction to branch & bound method · Travelling salesman problem (branch & bound)
- Unit 5 · Short notes Advanced algorithms and complexity classes Advanced tree and graph algorithms · NP‑hard and NP‑complete problems · Approximation algorithms · Data stream algorithms · Design and complexity of parallel algorithms
More for AL-402
Other 4th semester AIML subjects
- AL-401 Introduction to Discrete Structure &Linear Algebra
- AL-403 Software Engineering
- AL-404 Computer Organization & Architecture
- AL-405 Machine Learning
- AL-406 Java Lab