Jesus A. Gonzalez Web Page
CSE5311-01 Design and Analysis of Algorithms, Fall 2018
Syllabus
Teaching Asistant
- TBA
- Office: TBA
- Office hours: TBA
Lectures
- The Role of Algorithms in Computer Science
- Getting Started
- Growth of Functions
- Divide and Conquer
- Sorting Part A
- Sorting Part B
- Dynamic Programming
- Greedy Algorithms
- B - trees
- Minimum Spanning Trees Prim's algorithm example, step by step
- Single Source Shortest Paths Bellman Ford example, step by step
- All Pairs Shortest Paths
- Maximum Flow
- Multithreaded Algorithms
- NP-Completeness
Exams
- Midterm 1, TBD
- Midterm 2, TBD
- Midterm 3, TBD
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