# Fall 2021 - CMPT 307 D200

## Overview

• #### Course Times + Location:

Mo, We, Fr 3:30 PM – 4:20 PM
SSCB 9200, Burnaby

• #### Exam Times + Location:

Dec 20, 2021
7:00 PM – 10:00 PM
EDB 7618, Burnaby

• #### Prerequisites:

CMPT 225, MACM 201, (MATH 150 or MATH 151), and (MATH 232 or MATH 240), all with a minimum grade of C-. MATH 154 or MATH 157 with a grade of at least B+ may be substituted for MATH 150 or MATH 151.

## Description

#### CALENDAR DESCRIPTION:

Design and analysis of efficient data structures and algorithms. General techniques for building and analyzing algorithms (greedy, divide & conquer, dynamic programming, network flows). Introduction to NP-completeness.

#### COURSE DETAILS:

The objective of this course is to introduce concepts and problem-solving techniques that are used in the design and analysis of efficient algorithms. This is done by studying various algorithms, algorithmic techniques, and data structures.

## Topics

• Introduction and Mathematical Preliminaries (Review): Models of Computation, Big-O Analysis
• Searching and Sorting: Divide & Conquer Paradigm, Analysis of Recurrences, Master Method
• Sorting and Order Statistics: Heapsort, Quicksort, Non-comparison sorts, Lower bounds, Median
• Randomized algorithms, Average case analysis
• Simple Data Structures: Lists, Stacks, Queues, Trees
• Dictionaries and Priority Queues: (Balanced) Binary search trees, Heaps
• Graphs: Representations, Path Searching, Spanning Trees
• Amortized Analysis: Aggregate, Accounting, Potential Methods
• Optimization Problems: Dynamic programming, Greedy algorithms
• NP-Completeness

#### NOTES:

The course has a final examination, homework assignments, and quizzes or midterms. The grade distribution 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).

## Reference Books

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

• Introduction to Algorithms (3rd Edition), T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, MIT Press, 2009,

ISBN: 9780262033848

#### 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

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.