Spring 2023 - CMPT 705 G100
Design and Analysis of Algorithms (3)
Class Number: 6767
Delivery Method: In Person
Overview
-
Course Times + Location:
Jan 4 – Apr 11, 2023: Mon, Wed, Fri, 9:30–10:20 a.m.
Burnaby -
Exam Times + Location:
Apr 20, 2023
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.
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
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