Spring 2020 - CMPT 307 D100

Data Structures and Algorithms (3)

Class Number: 6670

Delivery Method: In Person

Overview

  • Course Times + Location:

    Mo, We, Fr 11:30 AM – 12:20 PM
    AQ 3005, Burnaby

  • Exam Times + Location:

    Apr 17, 2020
    12:00 PM – 3:00 PM
    TAKE HOME-EXAM, Burnaby

  • Instructor:

    Qianping Gu
    qgu@sfu.ca
    1 778 782-6705
  • 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 for the design and analysis of efficient algorithms through studying data structures, algorithms, and algorithmic techniques.

Topics

  • Introduction 1: algorithm design and analysis examples, computation models, Big-O analysis
  • Introduction 2: divide and conquer, analysis of recurrence, randomized algorithms
  • Sorting and order statistics: Heapsort, Quicksort, other sorting problems
  • Simple data structures: lists, stacks, queues, trees, hash tables
  • Algorithm design and analysis techniques, dynamic programming, greedy, amortized analysis
  • Advanced data structures, B-trees, Fibonacci heaps
  • Graph algorithms, graph search, minimum spanning trees, shortest paths
  • Selected topics, NP-completeness, string matching, maximum flow

Grading

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).

Materials

MATERIALS + SUPPLIES:

Reference Books

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

REQUIRED READING:

  • 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

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS