Jump to content

MTL342

From IITD Wiki
Revision as of 16:42, 14 April 2026 by DevanshKandpal (talk | contribs) (Bot: wrap bare course codes in wikilinks)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
MTL342
Analysis and Design of Algorithms
Credits 4
Structure 3-1-0
Pre-requisites MTL180
Overlaps COL351

MTL342 : Analysis and Design of Algorithms

Models of computation: RAM and Turing Machines; Algorithm Analysis techniques; Basic techniques for designing algorithms: dynamic programming, divide-and-conquer and Greedy; DFS , BFS and their applications; Some Basic Graph Algorithms; linear time sorting algorithms; NP-Completeness and Approximation Algorithms.