Design & Analysis of Algorithms
单元 · 7
- Asymptotic analysis & recurrences
- Divide & conquer
- Greedy
- Dynamic programming
- Backtracking & branch-and-bound
- Graph algorithms
- NP-completeness
项目
Build a delivery-route optimiser and prove its bounds
B.Tech
Computer Science & Engineering
测验与抽认卡
测试你的阅读成果,并通过间隔重复巩固记忆。
Bits AI
它可以根据你正在看的书籍、章节或测验题来回答。
同专业课程
查看所有课程Discrete Mathematics6 单元 · Propositional & predicate logicDigital Logic Design6 单元 · Number systems & codesObject-Oriented Programming (Java)7 单元 · Classes, objects & constructorsComputer Organization & Architecture7 单元 · Basic structure & instruction setsDatabase Management Systems7 单元 · Data models & ER designOperating Systems7 单元 · OS structure & system calls






