COMP 3170
COMP3170 - University of Manitoba - Shahin Kamali  

Course Information

         The following books are useful references available on reserve at the Sciences and Technology Library:

          Most Springer publications are available online at SpringerLink through the University of Manitoba Library.


    • Algorithms review
      • asymptotic notations
      • selection & quick-sort

    • Data structures
      • balanced search trees
      • skip lists
      • heaps
      • disjoint sets

    • computational complexity
      • lower bounds
      • Decision Problems
      • NP-completeness & polynomial reduction
      • satisfiability problem
      • complexity classes

    • Algorithmic Techniques
      • approximation algorithms
      • randomized algorithms
      • amortized analysis
      • graph algorithms
      • randomized algorithms
      • string matching

List of topics & course material

        1. Introduction to Algorithms

        4. Algorithmic Techniques

            Approximation algorithms, graph algorithms

            Approximation Algorithms: slides and handouts
          
assignment 6
            solutions for assignment 6