This hands-on course follows on from COMP 1510. This course covers the fundamental concepts of design, development, testing, and debugging intermediate-level programs in a procedural language. Topics include language syntax, data abstraction and encapsulation, error handling, graphical user interfaces, and the implementation of selected data structures and algorithms.
IMPORTANT INFO: This course is 60 hours offered as a classroom (36 hours) AND online (24 hours) format. The class meets once per week for 3 hours face to face and requires an additional 2 hour per week online. Reading, home work and assignments may require an additional 5+ hours per week outside of class. The average total commitment for this course is 6-8 hours each week. Due to the substantial time required on labs and assignments, students are advised not to take any other programming language courses simultaneously. Class will be in session February 16 (Family Day).
This course offering is in progress and full. Please check back next term or subscribe to receive email updates.
In Progress and Full
Upon successful completion of this course, the student will be able to:
Apply the properties of good procedural software design including encapsulation, information hiding, and functional decomposition to create easily extensible systems in the context of intermediate-level programs.
Decompose a program into multiple modules with well defined interfaces.
Analyze and explain behaviour of intermediate-level programs involving procedural programming constructs including encapsulation, information hiding, and functional decomposition.
Write programs using file processing to read and write textual or binary data.
Manage dynamic memory.
Design, implement, debug and test intermediate-level procedural programs in a modern high-level procedural programming language.
Develop recursive functions and compare recursion to iteration.
Use pointers to implement data structures and explain their relation to arrays and strings.
Implement data structures and basic algorithms including linked lists, binary search trees, insertion sort, selection sort & binary search.
Effective as of Winter 2019
COMP 2510 is offered as a part of the following programs:
Interested in being notified about future offerings of COMP 2510 - Procedural Programming?
If so, fill out the information below and we'll notify you by email when courses for each new term are displayed here.