Jesus A. Gonzalez Web Page

CSE5311-05 Design and Analysis of Algorithms, Spring 2019


Teaching Asistant


  1. The Role of Algorithms in Computer Science
  2. Getting Started
  3. Growth of Functions
  4. Divide and Conquer
  5. Sorting Part A
  6. Sorting Part B
  7. Dynamic Programming
  8. Greedy Algorithms
  9. B - trees
  10. Minimum Spanning Trees Prim's algorithm example, step by step
  11. Single Source Shortest Paths Bellman Ford example, step by step
  12. All Pairs Shortest Paths
  13. Maximum Flow
  14. Multithreaded Algorithms
  15. NP-Completeness



Your will make a presentation about a topic in the algorithms textbook that you choose but that is not covered in class. Please, follow the next guidelines: All the previous will be taken into account to assign your grade.

Exercises Sessions