Fall 2021 - CMPT 405 D100

Design and Analysis of Computing Algorithms (3)

Class Number: 4646

Delivery Method: In Person

Overview

  • Course Times + Location:

    Mo 2:30 PM – 4:20 PM
    WMC 3260, Burnaby

    We 2:30 PM – 3:20 PM
    AQ 3154, Burnaby

  • Exam Times + Location:

    Dec 16, 2021
    12:00 PM – 3:00 PM
    SSCC 9002, Burnaby

  • 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:

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.

COURSE-LEVEL EDUCATIONAL GOALS:

Topics

  • Greedy Algorithms
  • Dynamic Programming
  • Network Flow
  • Linear Programming
  • Approximation Algorithms
  • Local Search
  • Randomized Algorithms
  • NP-Completeness

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
  • Algorithms, Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, McGraw-Hill Education, 2006, 9780073523408

REQUIRED READING:

  • Algorithm Design, J. Kleinberg, E. Tardos, Addison-Wesley, 2006,

ISBN: 9780321295354

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

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

TEACHING AT SFU IN FALL 2021

Teaching at SFU in fall 2021 will involve primarily in-person instruction, with approximately 70 to 80 per cent of classes in person/on campus, with safety plans in place.  Whether your course will be in-person or through remote methods will be clearly identified in the schedule of classes.  You will also know at enrollment whether remote course components will be “live” (synchronous) or at your own pace (asynchronous).

Enrolling in a course acknowledges that you are able to attend in whatever format is required.  You should not enroll in a course that is in-person if you are not able to return to campus, and should be aware that remote study may entail different modes of learning, interaction with your instructor, and ways of getting feedback on your work than may be the case for in-person classes.

Students with hidden or visible disabilities who may need class or exam accommodations, including in the context of remote learning, are advised to register with the SFU Centre for Accessible Learning (caladmin@sfu.ca or 778-782-3112) as early as possible in order to prepare for the fall 2021 term.