Spring 2020 - CMPT 405 D100
Design and Analysis of Computing Algorithms (3)
Class Number: 6749
Delivery Method: In Person
Overview
-
Course Times + Location:
Jan 6 – Apr 9, 2020: Mon, Wed, Fri, 2:30–3:20 p.m.
Burnaby -
Exam Times + Location:
Apr 20, 2020
Mon, 8:30–11:30 a.m.
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, linear programming, etc.), and then 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
- Randomized Algorithms
- Linear Programming
- Algorithms for special cases of NP-hard problems
Grading
NOTES:
To 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
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