Lists, stacks, queues, priority queues, trees, graphs, and their associated algorithms; file structures; sorting, searching, and hashing techniques; time and space complexity. Antirequisite(s): Software Engineering 2205A/B, the former Software Engineering 202a/b. Prerequisite(s): Computer Science 1027A/B or 2101A/B with at least 65% or Computer Science 1037A/B with at least 60%, and 1.0 course chosen from the following, with at least 60% in each: Applied Mathematics 1201A/B or the former Calculus 1201A/B, Applied Mathematics 1413, Calculus 1000A/B, 1100A/B, 1301A/B, 1500A/B, 1501A/B, Mathematics 1600A/B or the former Linear Algebra 1600A/B. Corequisite(s): Pre-or Corequisite(s): Extra Information: 3 lecture hours, 0.5 course. back to top
