Simon Fraser University
Engaging the World

Course Outlines

Spring 2026 - CMPT 307 D100

Data Structures and Algorithms (3)

Class Number: 5443

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 5 – Apr 10, 2026: Mon, 10:30–11:20 a.m.
    Burnaby

    Jan 5 – Apr 10, 2026: Thu, 10:30 a.m.–12:20 p.m.
    Burnaby

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

Topics include:

  • Foundations: Algorithms in computing, algorithm design and analysis examples, Big-Oh notation, growth of functions, divide and conquer algorithms, recurrence analysis, randomized algorithms, average case analysis.
  • Sorting and order statistic: Heapsort, Quicksort, lower bound on comparison, based sorting, sorting in linear time, median and other statistics.
  • Data structures: Elementary data structures, hash tables, binary search trees.
  • Algorithm design and analysis techniques: Dynamic programming, greedy, amortized analysis.
  • Advanced data structures: B-trees, data structure for disjoint sets.
  • Graphs algorithms: Graph search, minimum spanning trees, shortest paths.
  • Selected topics: Maximum flow, NP-completeness, others

Grading

  • Quizzes 60%
  • Final Exam 40%

NOTES:

There will be four quizzes each worth 15%. Dates will be announced in class. The final exam will be cumulative and cover all content from the course.

REQUIREMENTS:

 Students must attain an average passing grade on the quizzes and pass the final exam in order to obtain a clear pass (C- or better).

Materials

REQUIRED READING:

Introduction to Algorithms, 4th edition, by T.H. Cormen, C.E. Leiserson, R.L. Rivest and C.Stein, 2022
ISBN: 026204630X

RECOMMENDED READING:

Algorithm Design, by J. Kleinberg and É. Tardos. Addison-Wesley, 2006
ISBN: 9780321295354

REQUIRED READING NOTES:

Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.

Department Undergraduate Notes:

The following are default policies in the School of Computing Science. Please check your course syllabus whether the instructor has chosen a different policy for your class, otherwise the following policies apply.
 
  • Students must attain an overall passing grade on the weighted average of exams in the course in order to get a C- or higher.
  • All student requests for accommodations for their religious practices must be made in writing by the end of the first week of classes, or no later than one week after a student adds a course. After considering a request, an instructor may provide a concession or may decline to do so. Students requiring accommodations as a result of a disability can contact the Centre for Accessible Learning (caladmin@sfu.ca).

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

At SFU, you are expected to act honestly and responsibly in all your academic work. Cheating, plagiarism, or any other form of academic dishonesty harms your own learning, undermines the efforts of your classmates who pursue their studies honestly, and goes against the core values of the university.

To learn more about the academic disciplinary process and relevant academic supports, visit: 


RELIGIOUS ACCOMMODATION

Students with a faith background who may need accommodations during the term are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.