Topics Covered in Algorithms Class

 

Topics covered in Algorithms class and selective slides from Internet.

Josephus Problem
Heaps and 2-3 trees slides 1 slides 2
Fibonacci Heaps slides animation
Amortized complexity video slides
Union/Find – average and worst case slides 1 slides 2
Sorting and selection slides
Minimum spanning tree algorithms slides 1 slides 2
NP-completeness - definitions, implications, reductions slides
Traveling Salesperson Problem - approximations Christofides Algorithm
Shortest path problems - Dijkstra's and Floyd's algorithms slides
Matrix multiplication, Strassen's algorithm slides
Polynomial multiplication and evaluation;
Fast Fourier Transform
Dynamic programming

MIT open course

Related posts:

  1. Conference List in Software Engineering Research Area
  2. Software Engineering Evaluation
  3. Research Topics for Software Engineering – Between SE and NLP
  4. Software Engineering Research Topics – Diagram of General Perspective
Category >> CS Courses  
If you want someone to read your code, please put the code inside <pre><code> and </code></pre> tags. For example: 
<pre><code> 
String foo = "bar";
</code></pre>