githubEdit

CSE303 / DAA

Syllabus

Resources

chevron-rightM1: Introductionhashtag
chevron-rightM2: Divide & Conquerhashtag
  • Structure of divide-and-conquer algorithms

    • Examples: Binary search, Quick sort, Merge sort, Strassen multiplication

    • Analysis of run time recurrence relations

  • Greedy Method

    • Overview of greedy paradigm

    • Examples:

      • Exact optimization: Minimum Cost Spanning Tree

      • Approximate solution: Knapsack Problem

      • Single source shortest paths

      • Traveling Salesman


chevron-rightM3: Dynamic Programminghashtag
chevron-rightM4: Graph Search & Traversalhashtag
chevron-rightM5: Computational Complexityhashtag
  • Complexity measures

  • Polynomial vs non-polynomial time complexity

  • NP-hard and NP-complete classes with examples


Notes

MidTerm

arrow-down-to-square CSE303-M1+M2-MidTerm-Notesarrow-up-right

EndSem

[⤓]

Question Directory

Previous Year Questions

Mid-Sem-PYQ

End-Sem-PYQ

External Sources


Last updated