Simon Fraser University
Engaging the World

Course Outlines

Spring 2020 - CMPT 307 D200

Data Structures and Algorithms (3)

Class Number: 6671

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 6 – Apr 9, 2020: Tue, 2:30–4:20 p.m.
    Surrey

    Jan 6 – Apr 9, 2020: Thu, 2:30–3:20 p.m.
    Surrey

  • Prerequisites:

    CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.

Description

CALENDAR DESCRIPTION:

Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms.

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, data structures, and application

Topics

  • Algorithms with Numbers: Asymptotics, Arithmetic, Cryptography, Hashing, Randomization
  • Divide-and-Conquer: Recurrences, Sorting, Selection, Lower bounds, Fast Fourier Transform
  • Graphs: Graph Searches and Applications, Trees, Shortest paths, Priority queues and heaps
  • Greedy Algorithms: Spanning trees, Disjoint sets, Amortized analysis, Huffman encoding
  • Dynamic Programming: Shortest paths, Longest subsequences, Edit distance, Sequence alignment
  • Introduction to NP-Completeness: Reductions, Approximation algorithms
  • Linear Programming

Grading

NOTES:

The course grade will be based on a midterm exam and final examination. There will be some graded assignments as well. The exact grade distribution will be announced during the first week of classes in a detailed course outline.

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

  • 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, 9780262033848

REQUIRED READING:

  • Algorithms
  • S. Dasgupta, C. Papadimitriou, U. Vazirani,
  • McGraw-Hill Higher Education,
  • 2008

An e-text version is available: ISBN 9780077244330
ISBN: 9780073523408

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