Fall 2026 - CMPT 225 D200
Data Structures and Programming (3)
Class Number: 4850
Delivery Method: In Person
Overview
-
Course Times + Location:
Sep 9 – Dec 6, 2026: Tue, 11:30 a.m.–1:20 p.m.
BurnabySep 9 – Dec 6, 2026: Thu, 11:30 a.m.–12:20 p.m.
Burnaby
-
Instructor:
Igor Shinkar
ishinkar@sfu.ca
-
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.
Students must attain an overall passing grade on the weighted average of midterm and final exams in order to get a clear pass (C- or better).
Materials
MATERIALS + SUPPLIES:
External resources linked in this course are provided for supplementary learning purposes. These materials are owned and maintained by their respective authors and institutions. Access is subject to the availability and terms of use of the external website. Students should not redistribute copyrighted materials obtained through these links without permission from the copyright holder.
Related courses:
RECOMMENDED READING:
Recommended reading (not required)
- Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
- Algorithms, Robert Sedgewick and Kevin Wayne.
- Object-Oriented Data Structures Using Java, Nell Dale, Daniel T. Joyce, Chip Weems.
- Effective Java, Joshua Bloch.
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 D 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).
- Use of AI tools by students for completing graded scholarly activities and course submissions that has not been explicitly authorized by the instructor will be considered as plagiarism under SFU’s Code of Academic Policy (http://www.sfu.ca/policies/teaching/t10-02.htm). Following this policy, instructors will report all instances of plagiarism to the academic integrity board.
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:
- SFU’s Academic Integrity Policy: S10-01 Policy
- SFU’s Academic Integrity website, which includes helpful videos and tips in plain language: Academic Integrity at SFU
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.