CS 1910

Students will be introduced to computational thinking. They will learn how abstraction and decomposition can be used to solve problems and how to create, analyse and trace their own algorithmic solutions. They will iterate and improve their solutions through pseudocode and through implementation in a procedural programming paradigm. They will learn the following programming constructs: built-in types and user defined types, decision structures, repetition structures, functions and ways to represent data. They will learn to test their code through unit testing to ensure correctness of their programs. PREREQUISITE: Grade XII academic mathematics. Three lecture hours and 1.5 hours lab per week