Phase Description Deadline Download
Phase 1 Implementation of classic algorithms: Coin Change (greedy & DP), Matrix Chain Multiplication, LIS/LCS, Huffman Coding, Graph algorithms (Dijkstra, Floyd‑Warshall), Knapsack (fractional & 0/1), and Climb Stairs. — From‑scratch coding, autograder validation. Ordibehesht 23, 1405 📄 ZIP
Phase 2 Advanced techniques: Knuth Optimization for optimal merge, Rabin‑Karp string matching, O(n log n) LIS, FPTAS for 0/1 knapsack, Edmonds‑Karp max flow, and Floyd‑Warshall all‑pairs shortest paths. — Theoretical analysis included. Khordad 7, 1405 📄 ZIP
Phase 3 NP‑hard problems: Held‑Karp DP for TSP, Hamiltonian cycle/path backtracking, Graph coloring (greedy/backtracking), 2‑approximation for metric TSP (MST‑based), and written questions on P, NP, NP‑completeness. Khordad 25, 1405 📄 ZIP

📌 Note: Detailed instructions and submission guidelines will be announced via Telegram and Quera. The autograder must pass all tests. For download issues, contact TAs.