Summer 2024 - CMPT 225 D100

Data Structures and Programming (3)

Class Number: 4015

Delivery Method: In Person


  • Course Times + Location:

    May 6 – Aug 2, 2024: Mon, Wed, Fri, 1:30–2:20 p.m.

  • Prerequisites:

    (MACM 101 and (CMPT 125, CMPT 129 or CMPT 135)) or (ENSC 251 and ENSC 252), all with a minimum grade of C-.



Introduction to a variety of practical and important data structures and methods for implementation and for experimental and analytical evaluation. Topics include: stacks, queues and lists; search trees; hash tables and algorithms; efficient sorting; object-oriented programming; time and space efficiency analysis; and experimental evaluation. Quantitative.


This course explores fundamental algorithms and data structures that can help in developing elegant and efficient solutions to complex problems. We will study their specification, analysis, implementation (in C++), evaluation, and applications. Platform: Linux (Ubuntu) Language: C++


  • Object-oriented programming
  • Abstract data types (ADTs)
  • Data structures: lists, stacks, queues, trees, heaps, hash tables, disk-bound data
  • Algorithms: searching and sorting as well as time and space efficiency analysis of algorithms

Course Website

Course information and material such as lecture notes, lab instructions, assignments, office hours, TAs, etc., are posted on our course website. 

The link to our CMPT 225 course website is

Important: This link will become active the first week of the Summer semester.


Learning incomes and outcomes will be presented and explained in class.



Grades for this course may be based on: design and programming assignments, in-lab activities and examinations.

The exact details of the course marking scheme will be discussed during the first week of the semester and posted on our course website.


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

The above rule will be explained and illustrated on our course website.



Reference Books

  • Data Abstractions & Problem Solving with C++, Walls and Mirrors, Frank M. Carrano and Timothy Henry, Pearson, 2012, 9780134463971, 7th or 6th edition (6th edition available online.)
  • Data Structures and Algorithms in C++, Michael T. Goodrich, Roberto Tamassia and David Mount, Wiley, 2011, 9780470383278, Available online.
  • Programming, Principles and Practice Using C++ (2nd ed), Bjarne Stroustrup, Addison Wesley, 2014, 9780321992789, Available online. Also, any good C++ reference is okay.

Registrar Notes:


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