COMP-261 – Algorithms and Data Structures
|Points:||15||Prerequisites:||COMP 103, MATH 161|
|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.
Please note: This information is accurate for the 2014 academic year. Please refer to Course Catalogue for 2013 information.
1 hour every other week
Alex Potanin, Algorithms and Data Structures, Addison-Wesley, 2011
Trimester 1 2014
* indicates instructor is the course coordinator.
|CRN||From/To||Days||Time||Building [Campus]||Room||Instructor||18314||3 Mar – 20 Apr 2014||Tue, Thu||1000 - 1050||Hugh Mackenzie [Kelburn]||LT205||3 Mar – 20 Apr 2014||Wed||0900 - 0950||Hugh Mackenzie [Kelburn]||LT205||5 May – 8 Jun 2014||Tue, Thu||1000 - 1050||Hugh Mackenzie [Kelburn]||LT205||5 May – 8 Jun 2014||Wed||0900 - 0950||Hugh Mackenzie [Kelburn]||LT205|