PG Course

Course: Advances in Algorithms

Presentation 1: Introduction: PG_AOA_INTRODUCTION
Pr-requisite: Students are advised to develop algorithms/read algorithms on topics given in the assignment 1 and 2.
AIA_MTECH_Pre-requisite
AIA_MTECH_Pre-requisite_SET2
Presentation 2: Lecture notes: Lecture_1
PG_UNIT1_PPT1
Presentation 3: Tutorial on Dynamic Programming: LCS and OBSTĀ  tutorial_practice_Dynamic_programming
Branch and Bound TSP: TSP_BB
Presentation on Numerical Algorithms: extended eucl
Modular-Exponentiation

Assignment: Geometric algorithm: Closest pair: closestpair_assignment
Assignment Question for 6 Marks: mtech
Presentations on NP Problems: NP-Complete1,
PresentationĀ  2: np
Presentation 3: np-2

Leave a Reply

Your email address will not be published. Required fields are marked *