Simon Fraser University
Engaging the World

Course Outlines

Summer 2023 - CMPT 125 D100

Introduction to Computing Science and Programming II (3)

Class Number: 3945

Delivery Method: In Person

Overview

  • Course Times + Location:

    May 8 – Aug 4, 2023: Wed, 3:30–4:20 p.m.
    Burnaby

    May 8 – Aug 4, 2023: Fri, 2:30–4:20 p.m.
    Burnaby

  • Exam Times + Location:

    Aug 15, 2023
    Tue, 3:30–6:30 p.m.
    Burnaby

  • Prerequisites:

    CMPT 120 or CMPT 130, with a minimum grade of C-.

Description

CALENDAR DESCRIPTION:

A rigorous introduction to computing science and computer programming, suitable for students who already have some background in computing science and programming. Intended for students who will major in computing science or a related program. Topics include: memory management; fundamental algorithms; formally analyzing the running time of algorithms; abstract data types and elementary data structures; object-oriented programming and software design; specification and program correctness; reading and writing files; debugging tools; shell commands. Students with credit for CMPT 126, 129, 135 or CMPT 200 or higher may not take this course for further credit. Quantitative.

COURSE DETAILS:

This course is a rigorous introduction to computing science, intended primarily for students who have already taken CMPT 120 as an introduction to algorithms and programming. Students will learn fundamental concepts of computing science and basic principles of algorithm design and software development.  This course uses C and C++.

Topics

  • Brief review of elementary programming and problem solving; introduction to C.
  • Performance measurements; algorithm design and analysis
  • Encodings of basic types: int, unsigned, float, char, pointer.
  • The memory model: addresses, dynamic data types, safe initialization, safe cleanup, and safe arrays.
  • Good coding style; defensive coding practices
  • Recursion
  • Reasoning about programs: assertions, invariants, and correctness.
  • Abstract data types; information hiding.
  • Elementary data structures: stacks, queues, binary trees.
  • Compound data types; basic object/method design in C++.

Grading

NOTES:

Weekly lab exercises and 3 programming assignments/projects, 2 midterms, final exam. Additional details and grading presented in the first lecture.

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

Materials

REQUIRED READING:

Seacord. (2020). Effective C Seacord, Robert. (1st edition.). No Starch Press.
An online version is available via a valid SFU account.
ISBN: 1718501048

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.

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

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

RELIGIOUS ACCOMMODATION

Students with a faith background who may need accommodations during the semester 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.