CMPE 365 Algorithms I Units: 4.00
Principles of design, analysis and implementation of efficient algorithms. Case studies from a variety of areas illustrate divide and conquer methods, the greedy approach, branch and bound algorithms and dynamic programming.
(Lec: 3, Lab: 1, Tut: 0)
(Lec: 3, Lab: 1, Tut: 0)
Requirements: Prerequisites: ELEC 278 or MREN 178, ELEC 270 or any discrete mathematics course
Corequisites:
Exclusions:
Offering Term: F
CEAB Units:
Mathematics 0
Natural Sciences 0
Complementary Studies 0
Engineering Science 24
Engineering Design 24
Offering Faculty: Faculty of Arts and Science
Course Learning Outcomes:
- CLOs coming soon; please refer to your course syllabus in the meantime.