# 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