CY-502 Design& Analysis of Algorithms Notes
5 notes for Design& Analysis of Algorithms, unit by unit.
Notes for CY-502
- 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 Algorithms Greedy algorithm strategy · Optimal merge patterns · Huffman coding · Minimum spanning trees · Knapsack problem · Job sequencing with deadlines
- Unit 3 · Short notes Dynamic Programming Dynamic‑programming characteristics · 0/1 knapsack problem · Multistage graph problem · Reliability design problem · Floyd‑Warshall algorithm
- Unit 4 · Short notes Backtracking Backtracking concept · 8‑queen’s problem · Hamiltonian cycle · Graph colouring problem · Branch‑and‑bound method · Traveling salesman problem
- Unit 5 · Short notes Advanced Tree and Graph Algorithms Advanced tree and graph algorithms · NP‑hard and NP‑complete problems · Approximation algorithms · Data‑stream algorithms · Design and complexity of parallel algorithms
More for CY-502
Other 5th semester CY subjects
- CY-501 OS Internals for Security Support
- CY-503 (A) Biometric Techniques for Security
- CY-503 (B) Network Security
- CY-503 (C) Data Security
- CY-504 (A) Cyber Law & Intellectual Property Rights
- CY-504 (B) Internet of Things
- CY-504 (C) Computer Organization & Architecture