CPS188
Computer Programming Fundamentals

Toronto Metropolitan University

Department of Computer Science

Land Acknowledgement
Toronto is in the 'Dish With One Spoon Territory'. The Dish With One Spoon is a treaty between the Anishinaabe, Mississaugas and Haudenosaunee that bound them to share the territory and protect the land. Subsequent Indigenous Nations and peoples, Europeans and all newcomers have been invited into this treaty in the spirit of peace, friendship and respect.

CPS188 - Computer Programming Fundamentals

Course Outline and Course Management Form [Winter 2024]

Professors

Lab Assistants and Markers

This course introduces concepts, theory and practice of computer programming, using the C programming language. It serves as a foundational course for higher year programming dependent engineering courses. In-depth emphasis is on program form/organization, pseudo-code, data types, conditional expressions, repetition, standard C libraries, casting,functions, arrays, pointers, sorting, recursion, matrix operations, dynamic storage, structures, linked lists, I/O. This is a required course in Biomedical, Computer, Electrical, Industrial, and Mechanical Engineering programs. (Students in other engineering programs can enrol with permission from their respective departments.)

None.

4 weekly lecture hours and 2 weekly lab hours.

See the official course website (https://www.cs.torontomu.ca/~cps188/), and your Professor's D2L shell (or website) for specific section information (details provided during the first class).

Jeri R. Hanly & Elliot B. Koffman (2016). Problem Solving and Program Design in C, 8th Edition*. Pearson. ISBN: 978-01342-4394-8

*Older editions or any other textbook with exercises in them are also recommended.

For the Computer Science Department labs: User's Guide to the Computer Science Department Labs
For the general TMUtorontomu labs: Academic Computing Labs

At the end of the course, a successful student will be able to:

1. Have an understanding of what are computers, how they work, and how data is represented and processed inside them.

2. Use the basic and advanced functionalities of the C programming language.

3. Create algorithms to solve different engineering related problems.

4. Write programs in the C programming language to solve simple and complex engineering problems.

Lab Practice & Assessment: 25%
Practical Midterm Test: 25%
Term Project: 25%
Final Examination: 25%

Cheating and plagiarism are a serious offenses. In accordance with the revised Policy 60 on academic integrity, a 10% penalty against your final course grade will be applied if submitted projects are found not to be original work in addition to the 0 (zero) mark which will be assigned for a non-original assignment.

Students are required to inform their instructors of any situation which arises during the semester which may have an adverse effect upon their academic performance, and must request any considerations and accommodations according to the relevant policies and well in advance. Failure to do so will jeopardize any academic appeals.

Medical certificates: If a student misses the deadline for submitting an assignment, or the date of an exam or other evaluation component because of illness, he or she must submit a TMU Health Certificate AND an Academic Consideration Request within 3 working days of the missed date.

Religious observance: If a student needs accommodation because of religious observance, he or she must submit a Request for Accommodation of Student Religious, Aboriginal and Spiritual Observance AND an Academic Consideration Request within the first 2 weeks of the class or, for a final examination, within 2 weeks of the posting of the examination schedule. If the required absence occurs within the first 2 weeks of classes, or the dates are not known well in advance as they are linked to other conditions, these forms should be submitted with as much lead time as possible in advance of the required absence. If you are a full-time or part-time degree student, then you submit the forms to your own program department or school (FYCSO). If you are a certificate or non-certificate student, then you submit the forms to the staff at the front desk of the Chang School.

In the event that the missed evaluation is the final exam, students are required, in addition to the forms previously mentioned, to petition for an INC grade with the Incomplete Grade Request Form. To be allowed to write the makeup exam, you will need that form and a verified Academic Consideration Request.

Week	Contents	Lecture Slides	Book Chapters	Lab Activities
① Jan 8-12	Overview of Computers and Programming Computer Hardware. Computer Software. Software Development Method. Internal Data Representation. Professional Ethics.	LESSON #1	Chapter 1	NO LAB
② Jan 15-19	Overview of C C Language Elements. Variable Declarations and Data Types. Executable Statements. General Form of a C Program. Arithmetic Expressions. Formatting Numbers in Program Output. Interactive Mode, Batch Mode, and Data Files. Common Programming Errors.	LESSON #2	Chapter 2	NO LAB
③ Jan 22-26	Top-Down Design with Functions Modular programming. Library functions. Functions without arguments. Functions with input arguments. Defining and using functions.	LESSON #3	Chapter 3	LAB #1
④ Jan 29-Feb 2	Control Structures I Control Structures and Conditions. The if Statement. If Statements with Compound Statements. Decision Steps in Algorithms and More Problem Solving. Nested if Statements and Multiple-Alternative Decisions. The switch Statement.	LESSON #4	Chapter 4	LAB #2
⑤ Feb 5-9	Control Structures II Repetition and Loop Statements. The while Statement. The for Statement. Conditional Loops. Loop Design. Nested Loops. The do-while statement and Flag-Controlled Loops. Iterative Approximations. How to Debug and Test Programs. Advanced Loops.	LESSON #5	Chapter 5	LAB #3
⑥ Feb 12-16	Pointers and Modular Programming Pointers and the Indirection Operator. Functions with Output Parameters. Multiple Calls to a Function with Input/Output Parameters. Scope of Names. Formal Output Parameters as Actual Arguments.	LESSON #6	Chapter 6	LAB #4
⑦ Feb 19-23	Study Week No classes. No labs.	-	-	-
⑧ Feb 26-Mar 1	Numerical Arrays Declaring and Referencing Arrays. Array Subscripts. Arrays and Loops. Arrays and Functions. Searching and Sorting an Array. Parallel Arrays and Enumerated Types. Multidimensional Arrays. Advanced Arrays.	LESSON #7	Chapter 7	LAB #5
⑨ Mar 4-8	Strings and Plotting Strings and Characters Operations. Concatenation and Whole-Line Input. String Comparison. String-to-Number and Number-to-String Conversions. Working with large data sets. Introduction to plotting with GNUPlot.	LESSON #8	Chapter 8	PRACTICAL MIDTERM TEST
⑩ Mar 11-15	Recursion The Nature of Recursion. Tracing a Recursive Function. Recursive Mathematical Functions. Recursive Functions with Array and String Parameters. Problem Solving with Recursion. Case Studies.	LESSON #9	Chapter 9	LAB #6
⑪ Mar 18-22	Structure and Union Types + Binary Files User-Defined Structure Types. Structure Type Data as Input and Output Parameters. Functions Whose Result Values Are Structured. Problem Solving with Structure Types. Parallel Arrays and Arrays of Structures. Union Types. Binary Files.	LESSON #10	Chapters 10, 11	LAB #7
⑫ Mar 25-29	Programming in the Large Using Abstraction to Manage Complexity. Personal Libraries: Header Files and Implementation Files. Storage Classes. Modifying Functions for Inclusion in a Library. Conditional Compilation. Command-Line Arguments. Defining Macros with Parameters.	LESSON #11	Chapter 12	TERM PROJECT DUE
⑬ Apr 1-5	Advanced Data Structures Dynamic Memory Allocation. Linked Lists. Stacks and Queues. Ordered Lists. Binary Trees.	LESSON #12	Chapter 13	LAB #8
⑭ Apr 8-12	Course Review Course review and question period.	-	-	NO LAB