3 unit(s) Data abstraction; algorithm analysis; recursion; lists; stacks; queues; trees; searching; hashing; sorting.
Two lectures, one tutorial, one lab every other week; second term
Prerequisite(s): ENGINEER 1D04 or ENGINEER 1P13 and COMPENG 2SH4
Antirequisite(s): COMPSCI 2C03, COMPSCI 2DM3, SFWRENG 2C03, SFWRENG 2DM3, COMPENG 2SI4