SYDE 423Computer Algorithm Design and Analysis
- Faculty
- Engineering
- Offered
- Fall
- Credit
- 0.5
- Last listed
- 1994–95
No longer offered. It’s in Waterloo’s scanned calendars from 1988–89 to 1994–95; the 1995–96 to 2023–24 calendars are on ucalendar.
Design of efficient algorithms and methods for their analysis, mathematical algorithms, string processing algorithms, geometrical algorithms, exhaustive search and traversal techniques, introduction to a lower bound theory and NP-completeness, examples from engineering problems.
As printed in the 1988–89 to 1994–95 calendars, read by OCR; the scanned page is the original. Later calendars (1995–96 on) aren’t on uwloo.
Requirements, as last listed
Prereq: SY DE 352 or equivalent
In today’s calendar
- ECE 606 lists it as an antirequisite
Check it elsewhere
- Undergraduate Calendar, 1995–96If it ran past 1994–95, on ucalendar
- Course outlinesSyllabi from past terms (UW login)
- UW FlowStudent ratings and reviews
- WClassesPast sections back to 2004, and who taught them
In the scanned calendars
How it read in each calendar from 1988–89 to 1994–95, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1988–89 to 1994–95 7 calendars
Design of efficient algorithms and methods for their analysis, mathematical algorithms, string processing algorithms, geometrical algorithms, exhaustive search and traversal techniques, introduction to a lower bound theory and NP-completeness, examples from engineering problems.
Prereq: SY DE 352 or equivalent
Offered Fall · 3 class, 1 tutorial hours a week · 0.5 credit