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.
Three lectures, one tutorial (one hour); first term; may be offered also in the first term Prerequisite(s):
• COMPSCI 1DM3 or 2DM3; COMPSCI 1XC3 or 1XD3 or 1MD3 or MATH 1MP3, and registration in any Computer Science program (see Department Note 3 in the course listing) or in the Minor in Computer Science. Antirequisite(s):SFWRENG 2C03, COMPENG 3SM4
