CS-402 Analysis Design of Algorithm Notes
6 notes for Analysis Design of Algorithm, unit by unit.
Notes for CS-402
- Unit 1 · Short notes Fundamentals of Algorithms and Asymptotic Analysis Definition and classification of algorithms · Designing algorithms · Analyzing algorithms · Asymptotic notations (O, Ω, Θ, o, ω) · Heap data structure · Heap sort algorithm
- Unit 2 · Short notes Divide and Conquer Techniques Principles of divide and conquer · Binary search algorithm · Merge sort algorithm · Quick sort algorithm · Strassen’s matrix multiplication
- Unit 3 · Short notes Greedy Algorithms Greedy strategy concept · Optimal merge patterns · Huffman coding · Minimum spanning trees (Kruskal and Prim) · Knapsack problem (greedy approach) · Job sequencing with deadlines
- Unit 4 · Short notes Dynamic Programming Dynamic programming paradigm · 0/1 knapsack problem using DP · Multistage graph problems · Reliability design problems · Floyd‑Warshall all‑pairs shortest path algorithm
- Unit 5 · Short notes Backtracking, Branch & Bound and Parallel Algorithms Backtracking technique · 8‑Queens problem · Hamiltonian cycle problem · Graph coloring problem · Branch and bound method · Traveling salesman problem using branch‑and‑bound
- Unit 6 · Short notes Tree and Graph Data Structures, Traversals and NP‑Completeness Binary search trees · Height‑balanced trees (AVL) · 2‑3 trees and B‑trees · Tree traversal techniques (in‑order, pre‑order, post‑order) · Graph traversal algorithms (DFS, BFS) · Fundamentals of NP‑completeness
More for CS-402
Other 4th semester CSE subjects
- BT-401 Mathematics-III
- CS-403 Software Engineering
- CS-404 Computer Org. & Architecture
- CS-405 Operating Systems
- CS-406 Programming Practices