Fall 2025 - CMPT 705 G100
Design and Analysis of Algorithms (3)
Class Number: 7456
Delivery Method: In Person
Overview
-
Course Times + Location:
Sep 3 – Dec 2, 2025: Mon, Wed, Fri, 8:30–9:20 a.m.
Burnaby -
Exam Times + Location:
Dec 4, 2025
Thu, 8:30–11:30 a.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 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. 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
REQUIRED READING:
Algorithm Design
J. Kleinberg, E. Tardos
Addison-Wesley
2006
ISBN: 9780321295354
RECOMMENDED READING:
- Introduction to Algorithms, 4th Ed.
- T. Cormen, C. Leiserson, R. Rivest, C. Stein,
- MIT Press
- ISBN 9780262046305
ISBN: 9780262046305
- Computers and Intractability: A Guide to The Theory of NP-Completeness,
- M.R. Garey, D.S. Johnson, W.H. Freeman,
- 1979
- ISBN: 9780716710455
ISBN: 9780716710455
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.
Department Graduate Notes:
-
Students must attain an overall passing grade on the weighted average of exams in the course in order to get a C- or higher.
-
All student requests for accommodations for their religious practices must be made in writing by the end of the first week of classes, or no later than one week after a student adds a course. After considering a request, an instructor may provide a concession or may decline to do so. Students requiring accommodations as a result of a disability can contact the Centre for Accessible Learning (caladmin@sfu.ca).
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:
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS
At SFU, you are expected to act honestly and responsibly in all your academic work. Cheating, plagiarism, or any other form of academic dishonesty harms your own learning, undermines the efforts of your classmates who pursue their studies honestly, and goes against the core values of the university.
To learn more about the academic disciplinary process and relevant academic supports, visit:
- SFU’s Academic Integrity Policy: S10-01 Policy
- SFU’s Academic Integrity website, which includes helpful videos and tips in plain language: Academic Integrity at SFU
RELIGIOUS ACCOMMODATION
Students with a faith background who may need accommodations during the term are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.