Fall 2019 - CMPT 128 D100

Introduction to Computing Science and Programming for Engineers (3)

Class Number: 8891

Delivery Method: In Person

Overview

  • Course Times + Location:

    Mo, Fr 11:30 AM – 12:20 PM
    AQ 3182, Burnaby

    We 11:30 AM – 12:20 PM
    SWH 10081, Burnaby

  • Exam Times + Location:

    Dec 9, 2019
    8:30 AM – 11:30 AM
    WMC 3520, Burnaby

  • Prerequisites:

    BC Math 12 (or equivalent, or any of MATH 100, 150, 151, 154, or 157).

Description

CALENDAR DESCRIPTION:

An introduction to computing science and computer programming, suitable for students wishing to major in Engineering Science or a related program. This course introduces basic computing science concepts, and fundamentals of object oriented programming. Topics include: fundamental algorithms and problem solving; abstract data types and elementary data structures; basic object-oriented programming and software design; elements of empirical and theoretical algorithmics; computation and computability; specification and program correctness; and history of computing science. The course will use a programming language commonly used in Engineering Science. Students with credit for CMPT 102, 120, 130 or 166 may not take this course for further credit. Students who have taken CMPT 125, 129, 135, or CMPT 200 or higher first may not then take this course for further credit. Quantitative/Breadth-Science.

COURSE DETAILS:

This course is a rigorous introduction to computing science and computer programming, suitable for engineering students. Students will learn fundamental concepts of computing science as well as develop basic skills in software development, with application to engineering problems.

Topics

  • Computer Systems, Algorithms, Program design and development, Programming tools
  • Basic data types, Representation of values of variables, Conversion between data types
  • Variables, arithmetic, logical and relational operators, Input and Output,
  • Functions, arguments, return values, scope,
  • Control structures: decision and repetition structures
  • 1D and 2D Arrays, structures, strings
  • Dynamic memory allocation and pointers
  • Recursion, Searching and Sorting, Anallyzing and Comparing Algorithms (Big 0)

Grading

NOTES:

To be finalized during the first week.
Grading: 30% Assignments and Lab Exercises, 30% in class/in lab quizzes and 40% Final Exam.

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:

  • Intro to Computing Science & Programming for Engineers (custom textbook)
  • Pearson
  • 2017
  • custom textbook

ISBN: 9781323688816

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