Simon Fraser University
Engaging the World

Course Outlines

Fall 2025 - CMPT 307 E100

Data Structures and Algorithms (3)

Class Number: 5482

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 3 – Oct 11, 2025: Mon, 4:30–6:20 p.m.
    Burnaby

    Oct 12 – Oct 22, 2025: Mon, 4:30–6:20 p.m.
    Burnaby

    Oct 23 – Dec 2, 2025: Mon, 4:30–6:20 p.m.
    Burnaby

    Sep 3 – Dec 2, 2025: Wed, 4:30–5:20 p.m.
    Burnaby

  • Exam Times + Location:

    Dec 8, 2025
    Mon, 7:00–10:00 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:

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 and data structures.

Topics

  • The following topics may be included:
  • Graph algorithms: DFS, BFS, Dijkstra's
  • Greedy algorithms: Kruskal's, Prim's, and others
  • Simple data structures: priority queues (with heaps) and union-find
  • Divide and conquer algorithms ant their analysis: solving recursions
  • Dynamic programming algorithms and their analysis
  • Flow algorithms and matching
  • Randomized algorithms
  • NP-completeness

Grading

NOTES:

The course has a final examination (worth 40% of the total grade).
There will be four homework assignments which won't be collected and graded. Instead, there will be four 50-min quizzes in class (worth 15% each).

Materials

MATERIALS + SUPPLIES:

Reference Material:

Introduction to Algorithms (3rd Edition), T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, MIT Press, 2009, 9780262033848

REQUIRED READING:

Algorithm Design
J. Kleinberg, É. 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.