Nota : Ceci est la version 2011鈥�2012 de l鈥檃nnuaire 茅lectronique. Veuillez mettre 脿 jour l鈥檃nn茅e dans la barre d鈥檃dresse de votre navigateur pour une version plus r茅cente de cette page, ou cliquez聽ici pour consulter l'annuaire la plus r茅cente.
Vue d'ensemble
Informatique (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.
Trimestres : Ce cours n鈥檈st pas au programme de l鈥檃nn茅e universitaire 2011-2012.
Charg茅s de cours : Aucun professeur n鈥檈st associ茅 脿 ce cours pour l鈥檃nn茅e universitaire 2011-2012.
- 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.