CISC 121/3.0 Introduction to Computing Science IOriginal Author: Bob Tennent
Most Recent Author: Wendy Powley
Last Revised: 2019-03-20
Introduction to design, analysis, and implementation of algorithms. Recursion, backtracking, and exits. Sequences. Elementary searching and sorting. Order-of-magnitude complexity. Documentation, iterative program development, translating natural language to code, testing and debugging.
Learning Hours: 120 (36L; 84P)
Recommendation: Some programming experience (such as high-school level programming or CISC 101/3.0 or CISC 110/3.0 or CISC 151/3.0) will be expected; see Introductory Courses in Departmental Notes.
Corequisite: CISC 102/3.0 or MATH 110/6.0 or MATH 111/6.0 or MATH 112/3.0 or MATH 120/6.0 or MATH 121/6.0 or MATH 123/3.0 or MATH 124/3.0 or MATH 126/6.0 or APSC 171/3.0 or APSC 172/3.0 or APSC 174/3.0 or COMM 161/3.0 or COMM 162/3.0.