Course Descriptions
This course is an examination of computational efficiency in representing and computing with large data sets. Students will become familiar with the use and performance characteristics of common data structures including stacks, queues, lists, trees, heaps, and hash tables. The techniques of asymptotic analysis using big-O notation will be introduced as a formal tool to understanding how computer programs scale in resource use for increasingly large inputs. A strong emphasis will be placed on developing the ability to choose the most appropriate data structures for a given computational task, and to roughly estimate the asymptotic complexity of programs with loops and nested function calls. Credit will not be given for SD311 and any of: SY301 and SI312.