Spring 2022 - CMPT 225 D200

Data Structures and Programming (3)

Class Number: 6163

Delivery Method: In Person


  • Course Times + Location:

    Mo, We, Fr 1:30 PM – 2:20 PM
    SSCB 9200, Burnaby

  • Exam Times + Location:

    Apr 13, 2022
    12:00 PM – 3:00 PM
    RCB IMAGTH, Burnaby

  • 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++), experimental evaluation, and applications. Platform: Linux (Ubuntu) Language: C++


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



Grades for this course may be based on: classroom participation and weekly exercises, programming assignments; lab activities; in-class written midterm exam; written final exam. The exact details of the marking scheme will be discussed during the first week of the semester.

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



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


Teaching at SFU in spring 2022 will involve primarily in-person instruction, with safety plans in place.  Some courses will still be offered through remote methods, and if so, this will be clearly identified in the schedule of classes.  You will also know at enrollment whether remote course components will be “live” (synchronous) or at your own pace (asynchronous).

Enrolling in a course acknowledges that you are able to attend in whatever format is required.  You should not enroll in a course that is in-person if you are not able to return to campus, and should be aware that remote study may entail different modes of learning, interaction with your instructor, and ways of getting feedback on your work than may be the case for in-person classes.

Students with hidden or visible disabilities who may need class or exam accommodations, including in the context of remote learning, are advised to register with the SFU Centre for Accessible Learning (caladmin@sfu.ca or 778-782-3112) as early as possible in order to prepare for the spring 2022 term.