Summer 2019 - CMPT 125 D100

Introduction to Computing Science and Programming II (3)

Class Number: 4711

Delivery Method: In Person

Overview

  • Course Times + Location:

    Mo, We, Fr 9:30 AM – 10:20 AM
    AQ 3182, Burnaby

  • Exam Times + Location:

    Aug 15, 2019
    8:30 AM – 11:30 AM
    Location: TBA

  • Prerequisites:

    CMPT 120. Corequisite: CMPT 127.

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: fundamental algorithms; elements of empirical and theoretical algorithmics; abstract data types and elementary data structures; basic object-oriented programming and software design; computation and computability; specification and program correctness; and history of computing science. Students with credit for CMPT 126, 129, 135 or CMPT 200 or higher may not take 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. All case studies will be presented using a C-like subset of C++. The co-requisite to this course is CMPT 127, which is a 3-credit lab course. Students who enroll in CMPT 125 will be manually enrolled in CMPT 127. Students are required to take both courses at once, but their grades will be assigned independently of each other. CMPT 127 is a programming-intensive lab, where students are expected to complete approximately 100 assignments (C++ programs) over the course of 12 weeks. Assignments build in difficulty and duration from five minutes to two hours. Roughly 8-12 assignment problems will be posed per week: the first 1-3 of which will be completed with instructors and TAs in mandatory guided labs; the remainder will be completed as independent homework.

Topics

  • Brief review of elementary programming and problem solving; introduction to C.
  • Performance measurements; algorithm design and analysis; asymptotics; fundamental algorithms.
  • Recursion: simple recursion; recursion on trees; divide and conquer algorithms.
  • Reasoning about programs: assertions, invariants, and correctness.
  • Good coding style; defensive coding practices; testing.
  • The memory model: addresses, dynamic data types, safe initialization, safe cleanup, and safe arrays.
  • Encodings of basic types: int, unsigned, float, char, pointer.
  • Compound data types; basic object/method design in C++.
  • Abstract data types; information hiding; elementary data structures.
  • Introduction to Social Issues

Grading

NOTES:

To be discussed the first week of classes

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

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

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS