CSE5311-04 Design and Analysis of Algorithms, Fall 2017

Syllabus

• Syllabus

Teaching Asistant

• TBA
• Office: TBA
• Office hours: TBA

Lectures

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

Exams

• Midterm 1, September 26, 2017
  • Topics:
• Midterm 2, October 26, 2017
  • Topics:
• Midterm 3, December 5, 2017
  • Topics:

  Presentations

  Your will make a presentation about an algorithm that you choose. Select your topic according to the following:
  • Find a research paper describing your algorithm and use it as your main reference. You may use more than one paper if necessary.
  • Show me your paper and get my approval to start working on your presentation.
  • Throughly understand the algorithm so that you are able to work on the following.
  • Describe how the algorithm works.
  • Describe the algorithm's computational complexity.
  • Provide examples of the practical use of the algorithm.
  • Make your presentation according to the previous points.
  • Present!!!
  All the previous will be taken into account to assign your grade.

Exercises Sessions