CS 136


Design, analysis and implementation of fundamental algorithms and data structures.

CS 116 or at least 60% in CS 135 or CS 145

Honours Mathematics students

Dan Holtby, Ali Abedi

Topics

  • Intro to C
  • Imperative C
  • The C Model
  • Pointers
  • Modularization
  • Arrays
  • Efficiency
  • Strings
  • Dynamic Memory
  • Linked Data
  • Abstract Data Types

Useful Links: