Algorithms

Search this site

Algorithmic Problem Solving

  • Algorithmic Problem Solving
    • Introduction
    • APS Documents
  • CSE190QC
    • Syllabus
    • Hours
    • Evaluation
  • CSE 101
    • Syllabus
    • Hours
    • Evaluation
    • Resources
  • CSE 202
    • Syllabus
    • Hours
    • Evaluation
    • Resources
  • CSE 190
    • Syllabus
    • Hours
    • Evaluation
  • CSE 203A
    • Syllabus
    • Evaluation and Hours
    • Documents

Resources

Resources for the Study of Algorithms

Algorithm Design Techniques and Problems

  1. Techniques for analyzing algorithms
  2. Proving the correctness of algorithms
  3. Problems with linear or sublinear complexity
  4. Divide and conquer method, searching and sorting
  5. Greedy method
  6. Dynamic programming
  7. Algorithms on graphs
  8. Backtracking
  9. Network flows
  10. NP-completeness and approximation algorithms
  11. Coding interview questions

General resources

  1. Guidelines for writing solutions
  2. Quantum computing: An Introduction to Quantum Computing by Kaye, Laflamme, and Mosca

Notes

  1. Correctness proof for Dijkstra's shortest-path algorithm
  2. Scheduling events to minimize the number of rooms
  3. Makespan problem --- approximation algorithm
  4. Weighted vertex cover --- approximation algorithm using layering method by Yatharth Saraf

Books and Online Materials

Sign in|Recent Site Activity|Report Abuse|Print Page|Powered By Google Sites