Fall 2020 - CMPT 405 D100

Design and Analysis of Computing Algorithms (3)

Class Number: 6618

Delivery Method: In Person

Overview

  • Course Times + Location:

    Mo, We, Fr 9:30 AM – 10:20 AM
    REMOTE LEARNING, Burnaby

  • Instructor:

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

    CMPT 307.

Description

CALENDAR DESCRIPTION:

Models of computation, methods of algorithm design; complexity of algorithms; algorithms on graphs, NP-completeness, approximation algorithms, selected topics.

COURSE DETAILS:

This is an advanced course on algorithms. We will review basic paradigms of algorithm design (greedy, divide-and-conquer, dynamic programming, etc.), and then explore some of the more advanced topics (e.g., NP-completeness, randomized algorithms, approximation algorithms, algorithms for special cases of NP-hard problems, etc.)

Topics

  • Greedy Algorithms
  • Divide and Conquer
  • Dynamic Programming
  • Network Flow
  • NP and Computational Intractability
  • Approximation Algorithms
  • Randomized Algorithms
  • Algorithms for special cases of NP-hard problems
  • Slected topics on advanced algorithms

Grading

NOTES:

The lectures will be delivered online at the scheduled class time (currently 9:30-10:20am, M/W/F), recorded and posted at some website. Grading will be based on assignments, midterm tests and final exam. Details will be announced during the first week of classes.

Students must attain an overall passing grade on the weighted average of exams in the course in order to obtain a clear pass (C- or better).

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

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

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

TEACHING AT SFU IN FALL 2020

Teaching at SFU in fall 2020 will be conducted primarily through remote methods. There will be in-person course components in a few exceptional cases where this is fundamental to the educational goals of the course. Such course components will be clearly identified at registration, as will course components that will be “live” (synchronous) vs. at your own pace (asynchronous). Enrollment acknowledges that remote study may entail different modes of learning, interaction with your instructor, and ways of getting feedback on your work than may be the case for in-person classes. To ensure you can access all course materials, we recommend you have access to a computer with a microphone and camera, and the internet. In some cases your instructor may use Zoom or other means requiring a camera and microphone to invigilate exams. If proctoring software will be used, this will be confirmed in the first week of class.

Students with hidden or visible disabilities who believe they may need class or exam accommodations, including in the current context of remote learning, are encouraged to register with the SFU Centre for Accessible Learning (caladmin@sfu.ca or 778-782-3112).