Fall 2019 - CMPT 705 G100

Design and Analysis of Algorithms (3)

Class Number: 9015

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 3 – Dec 2, 2019: Mon, Wed, Fri, 12:30–1:20 p.m.
    Burnaby

  • Exam Times + Location:

    Dec 8, 2019
    Sun, 12:00–3:00 p.m.
    Burnaby

  • Instructor:

    Qianping Gu
    qgu@sfu.ca
    1 778 782-6705

Description

CALENDAR DESCRIPTION:

The objective of this course is to expose students to basic techniques in algorithm design and analysis. Topics will include greedy algorithms, dynamic programming, advanced data structures, network flows, randomized algorithms. Students with credit for CMPT 706 may not take this course for further credit.

COURSE DETAILS:

This is an introductory graduate course on algorithms. We will review basic paradigms of algorithm design (greedy, dynamic programming, backtracking, linear programming, etc.), as well as explore some of the more advanced topics (e.g., randomized algorithms, approximation algorithms, streaming algorithms, etc.)

Topics

  • Greedy Algorithms
  • Divide and Conquer
  • Dynamic Programming
  • Network Flow
  • NP and Computational Intractability
  • Approximation Algorithms
  • Local Search
  • Randomized Algorithms
  • Linear Programming

Grading

NOTES:

To be announced during the first week of classes.

Materials

MATERIALS + SUPPLIES:

  • Introduction to Algorithms, 3rd Edition, T. Cormen, C. Leiserson, R. Rivest, C. Stein, McGraw Hill, 2003, 9780262033848
  • Computers and Intractability: A Guide To The Theory Of NP-Completeness, M. R. Garey, D. S. Johnson, W. H. Freeman, 1979, 9780716710455

REQUIRED READING:

Algorithm Design
J. Kleinberg, E. Tardos
Addison-Wesley
2006
ISBN: 9780321295354

Graduate Studies Notes:

Important dates and deadlines for graduate students are found here: http://www.sfu.ca/dean-gradstudies/current/important_dates/guidelines.html. The deadline to drop a course with a 100% refund is the end of week 2. The deadline to drop with no notation on your transcript is the end of week 3.

Registrar Notes:

SFU’s Academic Integrity web site http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating.  Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the University community.  Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS