Fall 2025 - CMPT 120 D100
Introduction to Computing Science and Programming I (3)
Class Number: 5417
Delivery Method: In Person
Overview
-
Course Times + Location:
Sep 3 – Dec 2, 2025: Mon, 2:30–4:20 p.m.
BurnabySep 3 – Dec 2, 2025: Wed, 2:30–3:20 p.m.
Burnaby -
Exam Times + Location:
Dec 9, 2025
Tue, 7:00–10:00 p.m.
BurnabyDec 9, 2025
Tue, 7:00–10:00 p.m.
BurnabyDec 9, 2025
Tue, 7:00–10:00 p.m.
Burnaby
-
Instructor:
Diana Cukierman
diana@sfu.ca
1 778 782-7110
-
Prerequisites:
BC Math 12 or equivalent is recommended.
Description
CALENDAR DESCRIPTION:
An elementary introduction to computing science and computer programming, suitable for students with little or no programming background. Students will learn fundamental concepts and terminology of computing science, acquire elementary skills for programming in a high-level language, e.g. Python. The students will be exposed to diverse fields within, and applications of computing science. Topics will include: pseudocode; data types and control structures; fundamental algorithms; recursion; reading and writing files; measuring performance of algorithms; debugging tools; basic terminal navigation using shell commands. Treatment is informal and programming is presented as a problem-solving tool. Students with credit for CMPT 102, 128, 130 or 166 may not take this course for further credit. Students who have taken CMPT 125, 129, 130 or 135 first may not then take this course for further credit. Quantitative/Breadth-Science.
COURSE DETAILS:
This course will be offered in person, face-to-face.
All the course information and communication will be centralized in the CANVAS CLOUD ENVIRONMENT course website which will be available by the first day of class. The course Canvas will include announcements, class materials, readings, assignments, points and course policies. Students should ensure that they receive notifications when announcements are posted on Canvas. The midterm/s exam date/s will be announced the first day of class. The weights (percentages) that each kind of activity will have in the course will be announced the first day of class. The final exam date is determined by SFU later in the semester.
In case class(es) must be taught remotely, students must have access to a computer with internet access, allowing the use of a conferencing system such as Zoom. Details of technology and tools needed in class and for tests will be provided the first class.
Topics
- Algorithms and computational thinking
- Procedural programming in Python
- Data types and control structures
- Application areas within computing science
- Fundamental algorithms, including searching, sorting, basics of recursion
- Computability and complexity, introduction
- Basics of binary encoding
Grading
NOTES:
Active participation is encouraged and expected during class time, including participation practice coding exercises and others, but NO points will be provided for attending to lectures. There will be assignments and multiple quizzes/exams.
Exams (midterm/s, final) will be in person, on paper.
A detailed marking scheme, schedule of exams and technology details will be provided in the first class of the semester. The final exam date is provided by SFU later in the semester.
The default policies in the School of Computing Science apply to this course (e.g. rule (1) described next, and the religious accommodation rule). Additionally, rule (2) described next also applies to this course:
- 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).
- Students must attain an overall passing grade on the final exam in order to pass the course.
Materials
MATERIALS + SUPPLIES:
Reference Books
Reference books are provided for your interest and are NOT required. Newer versions if available would be fine as well.- Computer Science Illuminated, Nell Dale, John Lewis, Jones & Bartlett, 2012, 9781449672843
- Starting out with Programming Logic and Design, Tony Gaddis, Pearson, 2015, 9780133985078
- Starting Out with Python-4th Edition, Tony Gaddis, Pearson, 2017, 9780134543666
REQUIRED READING:
Think Python - How to Think Like a Computer Scientist: Interactive Edition https://runestone.academy/runestone/books/published/thinkcspy/index.html, , This interactive text is available online for free
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:
-
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:
- 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.