Students are introduced to new types of data structures such as trees (including binary and multiway trees), heaps, stacks and queues. Students also design new algorithms for each data structure studied, create and perform simple operations on graph data structures, describe and implement common algorithms for working with advanced data structures, and recognize which data structure is the most appropriate for solving a particular problem. Prerequisites: There are no prerequisites for the course, but COMP 1231 is recommended. Note: Students cannot get credit for more than one of COMP 2230, COMP 2231.
Students are introduced to new types of data structures such as trees (including binary and multiway trees), heaps, stacks and queues. Students also design new algorithms for each data structure studied, create and perform simple operations on graph data structures, describe and implement common algorithms for working with advanced data structures, and recognize which data structure is the most appropriate for solving a particular problem. Prerequisites: There are no prerequisites for the course, but COMP 1231 is recommended. Note: Students cannot get credit for more than one of COMP 2230, COMP 2231.
