IT-403 Analysis and Design of Algorithm Notes
5 notes for Analysis and Design of Algorithm, unit by unit.
Notes for IT-403
- Unit 1 · Short notes Algorithms, Design and Analysis Algorithms · Designing algorithms · Analyzing algorithms · Asymptotic notations · Heap and heap sort · Divide and conquer technique
- Unit 2 · Short notes Greedy Algorithms Greedy strategy · Optimal merge patterns · Huffman coding · Minimum spanning trees · Knapsack problem · Job sequencing with deadlines
- Unit 3 · Short notes Dynamic Programming Dynamic programming · 0/1 knapsack problem · Multistage graph · Reliability design · Floyd‑Warshall algorithm
- Unit 4 · Short notes Backtracking and Branch & Bound Backtracking concept · 8‑queen’s problem · Hamiltonian cycle · Graph coloring problem · Branch and bound method · Traveling salesman problem
- Unit 5 · Short notes Tree Data Structures and NP‑Completeness Binary search trees · Height balanced trees · 2‑3 trees · B‑trees · Search and traversal techniques for trees and graphs (in‑order, pre‑order, post‑order, DFS, BFS) · NP‑completeness