COMP 362 — Honours Algorithm Design

Basic algorithmic techniques, their applications and limitations. Problem complexity, how to deal with problems for which no efficient solutions are known.

• Rating: 3.50 out of 5 from 76 student reviews
• Difficulty: 4.00 out of 5
• Credits: 3
• Faculty: Faculty of Science
• Department: Computer Science
• Taught by: Ade Vetta
• Prerequisite: COMP 252

Sections offered

• Section 001 (Lec), Mon Wed 10:05-11:25 am — 4 seats open