Simon Fraser University
Engaging the World

Course Outlines

Summer 2024 - CMPT 307 D100

Data Structures and Algorithms (3)

Class Number: 4052

Delivery Method: In Person

Overview

  • Course Times + Location:

    May 6 – Aug 2, 2024: Wed, 9:30–10:20 a.m.
    Surrey

    May 6 – Aug 2, 2024: Fri, 8:30–10:20 a.m.
    Surrey

  • Prerequisites:

    CMPT 225, (MACM 201 or CMPT 210), (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
  • Graphs: Representations, Path Searching, Spanning Trees, Network Flows
  • Amortized Analysis: Aggregate, Accounting, Potential Methods
  • Optimization Problems: Dynamic programming, Greedy algorithms, String Matching
  • NP-Completeness

Grading

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

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

SFU’s Academic Integrity website 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