COMP-261 – Algorithms and Data Structures
| Points: | 15 | Prerequisites: | COMP 103, MATH 161 |
|---|---|---|---|
| Faculty: | Engineering | Corequisites: | None |
| School: | Engineering & Comp Sci | Restrictions: | None |
This course covers a range of algorithms and data structures building on the fundamental structures and algorithms from COMP 103. The major areas covered are: graph algorithms, graphics algorithms and advanced data structures. This course takes a practical approach focusing on the implementation of a wide variety of algorithms.
Tuition Fees
Tutorials
1 hour every other week
Textbook
Alex Potanin, Algorithms and Data Structures, Addison-Wesley, 2011
Trimester 2 2013
* indicates instructor is the course coordinator.
| CRN | From/To | Days | Time | Building [Campus] | Room | Instructor | 18314 | 15 Jul – 20 Oct 2013 | Tue, Wed, Fri | 1610 - 1700 | Maclaurin [Kelburn] | LT102 | Peter Andreae* |
|---|

