Spring 2019 - CMPT 405 D100
Design and Analysis of Computing Algorithms (3)
Class Number: 6528
Delivery Method: In Person
Overview
-
Course Times + Location:
Jan 3 – Apr 8, 2019: Mon, Fri, 2:30–3:20 p.m.
BurnabyJan 3 – Apr 8, 2019: Wed, 2:30–3:20 p.m.
Burnaby -
Exam Times + Location:
Apr 18, 2019
Thu, 12:00–3:00 p.m.
Burnaby
-
Instructor:
Valentine Kabanets
kabanets@sfu.ca
1 778 782-6912
-
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:
The goal of this course is to provide a solid theoretical basis for the design and analysis of algorithms used throughout different branches of computer science. By the end of this course students will be able to design their own algorithms for commonly encountered computational problems and analyze their efficiency, or prove that an efficient algorithm is unlikely to exist and design and evaluate an approximation algorithm.
Topics
- Greedy Algorithms
- Dynamic Programming
- Graph Algorithms
- Linear Programming
- Models of Computation
- Computational Complexity
- Approximation Algorithms
Grading
NOTES:
10% participation, 20% midterm, 30% final exam, 40% assignments (best 4 out of 5).
Materials
RECOMMENDED READING:
Introduction to Algorithms
Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein
MIT Press
2009
ISBN: 9780262033848
Foundations of Algorithms
Richard Neapolitan, Kumarss Naimipour
Jones & Bartlett Learning
2014
5th Edition
ISBN: 9781284049190
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