Spring 2022 - CMPT 295 D100

Introduction to Computer Systems (3)

Class Number: 6145

Delivery Method: In Person

Overview

  • Course Times + Location:

    Mo 2:30 PM – 3:20 PM
    SWH 10081, Burnaby

    Th 2:30 PM – 4:20 PM
    AQ 3182, Burnaby

  • Prerequisites:

    Either (MACM 101 and (CMPT 125 or CMPT 135)) or (MATH 151 and CMPT 102 for students in an Applied Physics program), all with a minimum grade of C-.

Description

CALENDAR DESCRIPTION:

The curriculum introduces students to topics in computer architecture that are considered fundamental to an understanding of the digital systems underpinnings of computer systems.

COURSE DETAILS:

This course is primarily a course on computer systems and low-level programming. We will discuss the relationship between the computer architecture (the hardware) and the applications that run on it (the software), and the issues that influence the design of both. Programs will be written in both C and x86-64 assembly. We will explore how instructions are encoded and executed and how binary data types are encoded and interpreted by computer hardware, and how these issues relate to the performance and reliability of our applications.

Topics

  • Representation of numeric data
  • Machine language programs
  • Representation of instructions (instruction set architecture)
  • Basic digital systems
  • CPU organization
  • Memory organization
  • Program/Code optimization

Grading

NOTES:

Will be confirmed during the first week of the semester. Course activities will include (but may not be limited to) assignments, labs, midterm(s) and final examination.

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:

EITHER THIS ONE: Computer Systems - MasteringEngineering with Pearson eText -- Standalone Access Card -- for Computer Systems: A Programmer's Perspective, 3/E, Randal E. Bryant, David R. O'Hallaron, Pearson, 2016, e-text
ISBN: 9780134071923

OR THIS ONE: Computer Systems: A Programmer's Perspective, 3/E, Randal E. Bryant, David R. O'Hallaron, Pearson, 2016, hardcopy
ISBN: 9780134092669

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

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

TEACHING AT SFU IN SPRING 2022

Teaching at SFU in spring 2022 will involve primarily in-person instruction, with safety plans in place.  Some courses will still be offered through remote methods, and if so, this will be clearly identified in the schedule of classes.  You will also know at enrollment whether remote course components will be “live” (synchronous) or at your own pace (asynchronous).

Enrolling in a course acknowledges that you are able to attend in whatever format is required.  You should not enroll in a course that is in-person if you are not able to return to campus, and should be aware that remote study may entail different modes of learning, interaction with your instructor, and ways of getting feedback on your work than may be the case for in-person classes.

Students with hidden or visible disabilities who may need class or exam accommodations, including in the context of remote learning, are advised to register with the SFU Centre for Accessible Learning (caladmin@sfu.ca or 778-782-3112) as early as possible in order to prepare for the spring 2022 term.