COMP 261 – Algorithms and Data Structures
| Points: | 15 | Prerequisites: | COMP 103, MATH 161 (or 114) |
|---|---|---|---|
| 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 2012
* indicates instructor is the course coordinator.
| CRN | From/To | Days | Time | Building [Campus] | Room | Instructor | 18314 | 16 Jul – 21 Oct 2012 | Mon, Wed, Thu | 0900 - 0950 | New Kirk [Kelburn] | LT301 | Alex Potanin* |
|---|

