Algorithms
Search this site
Algorithmic Problem Solving
Algorithmic Problem Solving
Introduction
APS Documents
CSE 101
Syllabus
Hours
Evaluation
Resources
CSE 202
Syllabus
Hours
Evaluation
Resources
CSE 190
Syllabus
Evaluation and Hours
CSE 203A
Syllabus
Evaluation and Hours
Documents
Resources
Resources for the Study of Algorithms
Algorithm Design Techniques and Problems
Techniques for analyzing algorithms
Proving the correctness of algorithms
Problems with linear or sublinear complexity
Divide and conquer method, searching and sorting
Greedy method
Dynamic programming
Algorithms on graphs
Backtracking
Network flows
NP-completeness and approximation algorithms
Coding interview questions
General resources
Guidelines for writing solutions
Notes
Correctness proof
for Dijkstra's shortest-path algorithm
Scheduling events to minimize the number of rooms
Makespan problem --- approximation algorithm
Weighted vertex cover --- approximation algorithm using layering method
by Yatharth Saraf
Books and Online Materials