Note: This is the 2010鈥�2011 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click聽here to jump to the newest eCalendar.
Overview
Computer Science (Sci) : Basic data structures. Representation of arrays, stacks, and queues. Linked lists and their applications to binary trees. Internal sorting. Graph representation. Elementary graph algorithms.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
- 3 hours
- Prerequisites: MATH 133 and COMP 202
- Restrictions: COMP 203 and COMP 250 are considered to be equivalent from a prerequisite point of view, and cannot both be taken for credit. Students who are registered in the following programs: Major or Honours in Computer Science, Major in Software Engineering, any of the joint major programs offered through the Faculty of Science and the Major Concentration in Foundations of Computing, in the Faculty of Arts, may not take this course.