MTL342: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 4: | Line 4: | ||
| credits = 4 | | credits = 4 | ||
| credit_structure = 3-1-0 | | credit_structure = 3-1-0 | ||
| pre_requisites = MTL180 | | pre_requisites = [[MTL180]] | ||
| overlaps = COL351 | | overlaps = [[COL351]] | ||
}} | }} | ||
== MTL342 : Analysis and Design of Algorithms == | == 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. | 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. | ||
Latest revision as of 16:42, 14 April 2026
| 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.