uwloo

CS 112Introduction to Computer Programming

Faculty
Mathematics
Offered
Winter
Credit
0.5
Last listed
1994–95

No longer offered. It’s in Waterloo’s scanned calendars from 1976–77 to 1994–95; the 1995–96 to 2023–24 calendars are on ucalendar.

Fundamental techniques of algorithm design and program development. Topics include: structured programming, simple data elements, sequential operations, iterative statements, selection statements, data aggregations, functions and procedures, and an introduction to the development of databases. The examples demonstrate a variety of applications for computer programming. CS 112 cannot be counted for credit toward a BMath Honours degree. Course Descriptions Computer Science CS-130 F,W,S 2C,2T,2L 0.5 Concepts of Computer Programming Fundamental concepts of computer programming, including data types, structured programming, algorithm design, and numerical methods. Sample programs and exercises will be drawn from various areas of mathematics. Labs will emphasize Programming. CS 130 should be taken before CS 134 by students who have not had substantial programming experience.

As printed in the 1994–95 calendar, read by OCR; the scanned page is the original. Later calendars (1995–96 on) aren’t on uwloo.

Requirements, as last listed

Prereq: Computer literacy (e.g. CS 100 or extensive high school computing)

Antireq: CS 102, 130

Prereq: Full-time degree registration in the Faculty of Mathematics

Antireq: CS 102, 112

Also offered at St. Jerome’s College in the Fall term

Check it elsewhere

In the scanned calendars

How it read in each calendar from 1976–77 to 1994–95, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.

1994–95 1 calendar

Fundamental techniques of algorithm design and program development. Topics include: structured programming, simple data elements, sequential operations, iterative statements, selection statements, data aggregations, functions and procedures, and an introduction to the development of databases. The examples demonstrate a variety of applications for computer programming.

CS 112 cannot be counted for credit toward a BMath Honours degree.

Course Descriptions Computer Science

CS-130 F,W,S 2C,2T,2L 0.5 Concepts of Computer Programming Fundamental concepts of computer programming, including data types, structured programming, algorithm design, and numerical methods. Sample programs and exercises will be drawn from various areas of mathematics. Labs will emphasize Programming.

CS 130 should be taken before CS 134 by students who have not had substantial programming experience.

Prereq: Computer literacy (e.g. CS 100 or extensive high school computing)

Antireq: CS 102, 130

Prereq: Full-time degree registration in the Faculty of Mathematics

Antireq: CS 102, 112

Also offered at St. Jerome’s College in the Fall term

Offered Winter · 2 class, 2 tutorial, 2 lab hours a week · 0.5 credit

Not in the 1985–86 to 1993–94 calendars.

1976–77 to 1984–85 7 calendars

Titled Introduction to Business Problem Solving by Computer.

Emphasis on the solution of mathematical problems in business. Concept and properties of an algorithm. Language and notation for describing algorithms. Analysis of problems, development of models and algorithms; implementation in a procedure-oriented language (usually FORTRAN IV); execution of these programs using several systems.

Credit will only be granted for one of CS 112, CS 116, CS 118 of CS 140. CS 112 cannot be counted for credit toward a BMath degree.

Prereq: none.

Offered Fall, Winter · 2 class, 2 tutorial hours a week · 0.5 credit

* Listed that year without a description, or as not offered.