Upper and lower time and space bounds; levels of intractability; graph algorithms; greedy algorithms; dynamic algorithms; exhaustive search techniques; parallel algorithms. Antirequisite(s): Prerequisite(s): Computer Science 2210A/B and 2211A/B; Computer Science 2214A/B or Mathematics 2155A/B or Computer Science 2101A/B or registration in the fourth year of the BESc program in Computer Engineering. Corequisite(s): Pre-or Corequisite(s): Extra Information: 3 lecture hours, 0.5 course. back to top
