Simon Fraser University
Engaging the World

Course Outlines

Fall 2022 - CMPT 405 D100

Design and Analysis of Computing Algorithms (3)

Class Number: 5249

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 7 – Dec 6, 2022: Mon, 8:30–10:20 a.m.
    Burnaby

    Sep 7 – Dec 6, 2022: Wed, 8:30–9:20 a.m.
    Burnaby

  • Exam Times + Location:

    Dec 18, 2022
    Sun, 3:30–6:30 p.m.
    Burnaby

  • Instructor:

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

  • Prerequisites:

    CMPT 307 with a minimum grade of C-.

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:

Lectures will be in person at the scheduled class time (currently Monday 8:30-10:20am  and Wednesday 8:30-9:20am). 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:

Reference Books

  • 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

REQUIRED READING NOTES:

Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

SFU’s Academic Integrity website 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