Course Number:
CS 205
Transcript Title:
System Programming and Architecture
Created:
Nov 19, 2026
Updated:
Nov 19, 2026
Total Credits:
4
Lecture Hours:
33
Lecture / Lab Hours:
22
Lab Hours:
0
Satisfies Cultural Literacy requirement:
No
Satisfies General Education requirement:
No
Grading Options
A-F, P/NP, Audit
Default Grading Options
A-F
Repeats available for credit:
0
Prerequisites

CS 162, MTH 251Z

Course Description

Explores the mechanisms that connect source code to hardware execution through C programming and low-level code analysis. Investigates computer organization, binary data representation, and the role of instruction sets in controlling program behavior. Develops a foundation for future work in systems programming, cybersecurity, operating systems, and compiler design. Prerequisites: CS 162, MTH 251Z. Audit available.

Course Outcomes

Upon successful completion of this course, students will be able to:

  1. Apply the major components of computer architecture and explain their purposes and interactions and the instruction execution cycle.
  2. Apply a basic instruction set architecture, including the arithmetic, logic, and control instructions; user and control registers; and addressing modes.
  3. Perform simple arithmetic in hexadecimal, decimal, and binary notation and convert among these notations.
  4. Represent and use data types such as integers, characters, pointers, and floating-point numbers at the assembly level.
  5. Write C language programs that use control structures, functions, IO, arrays, and dynamic memory.
  6. Recognize how the information in this course applies within the overall context of computer science.

Suggested Outcome Assessment Strategies

The determination of assessment strategies is generally left to the discretion of the instructor. Here are some strategies that you might consider when designing your course: writings (journals, self-reflections, pre writing exercises, essays), quizzes, tests, midterm and final exams, group projects, presentations (in person, videos, etc), self-assessments, experimentations, lab reports, peer critiques, responses (to texts, podcasts, videos, films, etc), student generated questions, Escape Room, interviews, and/or portfolios.

Department suggested strategies: Programming, quizzes, exams, presentations.

Course Activities and Design

The determination of teaching strategies used in the delivery of outcomes is generally left to the discretion of the instructor. Here are some strategies that you might consider when designing your course: lecture, small group/forum discussion, flipped classroom, dyads, oral presentation, role play, simulation scenarios, group projects, service learning projects, hands-on lab, peer review/workshops, cooperative learning (jigsaw, fishbowl), inquiry based instruction, differentiated instruction (learning centers), graphic organizers, etc.

Course Content

Outcome #1: Apply the major components of computer architecture and explain their purposes and interactions and the instruction execution cycle.

  • Systems fundamentals
  • Machine cycle
  • Memory hierarchy
  • Memory organization, 
  • Stack
  • Heap
  • Call stack
  • Optimizations
  • Systems context

Outcome #2: Apply a basic instruction set architecture, including the arithmetic, logic, and control instructions; user and control registers; and addressing modes.

  • Machine cycle
  • Machine instructions
  • Control structures
  • Functions
  • Bitwise operations
  • Arrays  
  • Object files
  • Linking

Outcome #3: Perform simple arithmetic in hexadecimal, decimal, and binary notation and convert among these notations.

  • Binary and hexadecimal
  • Signed and unsigned numbers
  • Floating point representations
  • Arithmetic in C
  • Bitwise operations

Outcome #4: Represent and use data types such as integers, characters, pointers, and floating-point numbers at the assembly level.

  • Data types
  • Machine instructions
  • Integers
  • Floating point
  • Pointers
  • Stack
  • Heap
  • Arrays
  • Alignment

Outcome #5: Write C language programs that use control structures, functions, IO, arrays, and dynamic memory.

  • Syntax
  • I/O
  • Debugging
  • Control structures
  • Functions
  • Arrays
  • Strings
  • Pointers
  • Dynamic memory
  • Compiler optimizations

Outcome #6: Recognize how the information in this course applies within the overall context of computer science

  • Operating systems
  • Memory hierarchy
  • Compilation  
  • Performance
  • Cybersecurity
  • Overflow stacks
  • Systems programming applications

Suggested Texts and Materials

  • Computer Systems: A Programmers Perspective, Bryant & O’Hallaron
  • The Hidden Language of Computer Hardware & Software, 2nd edition, Charles Petzold

What is required will be up to the instructor teaching the course.