Fall 2025 - CMPT 225 D100

Data Structures and Programming (3)

Class Number: 5446

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 3 – Dec 2, 2025: Tue, 11:30 a.m.–1:20 p.m.
    Burnaby

    Sep 3 – Dec 2, 2025: Thu, 11:30 a.m.–12:20 p.m.
    Burnaby

  • Exam Times + Location:

    Dec 5, 2025
    Fri, 12:00–3:00 p.m.
    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-.

Description

CALENDAR DESCRIPTION:

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.

COURSE DETAILS:

The course will cover the ofllowing topics (possibly in different order)

  • Object-oriented programming in Java
  • Abstract data types (ADTs)
  • Data structures:
    • lists, stacks, queues, sets
    • trees, binary trees, binary search trees, self balancing trees
    • priority queues, heaps
    • hash tables
    • disk-bound data
  • Algorithms:
    • searching and sorting
    • graph traversing
    • recursion, divide and conquer
  • Time and space efficiency of algorithms. Big-O notation and the Master Theorem

Topics might slightly vary.

Grading

NOTES:

Grades for this course may be based on: programming assignments, midterm exam, final exam, and a final project.
The exact details of the marking scheme will be given in the first week of the course.

A student 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:

Related courses:

RECOMMENDED READING:

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.