3 unit(s) Basic data structures: stacks, queues, hash tables, and binary trees; searching and sorting; graph representations and algorithms, including minimum spanning trees, traversals, shortest paths; introduction to algorithmic design strategies; correctness and performance analysis. Implementation of data structures and algorithms.
Three lectures, one tutorial (one hour); second term Prerequisite(s):SFWRENG 2DM3; registration in any Software Engineering program Antirequisite(s):COMPSCI 2C03, COMPENG 3SM4
