Design & Analysis of Algorithms
Unit · 7
- Asymptotic analysis & recurrences
- Divide & conquer
- Greedy
- Dynamic programming
- Backtracking & branch-and-bound
- Graph algorithms
- NP-completeness
Proyek
Build a delivery-route optimiser and prove its bounds
B.Tech
Computer Science & Engineering
Kuis dan flashcard
Uji apa yang kamu baca dan ingat terus dengan pengulangan berjarak.
Bits AI
Menjawab tentang buku, bagian, hingga pertanyaan kuis yang sedang kamu kerjakan.
Di program yang sama
Lihat semua mata kuliahDiscrete Mathematics6 unit · Propositional & predicate logicDigital Logic Design6 unit · Number systems & codesObject-Oriented Programming (Java)7 unit · Classes, objects & constructorsComputer Organization & Architecture7 unit · Basic structure & instruction setsDatabase Management Systems7 unit · Data models & ER designOperating Systems7 unit · OS structure & system calls






