INFM 370 - Data Structures and Algorithms I

3 credit hours
Introduction to fundamental data structures and algorithms to solve computational problems. Emphasis on quantitative performance analysis of the various approaches along with applications. Topics include lists, queues, stacks, sorting (insertion, merge, quick), search trees (binary, red-black), and hash tables (separate chaining, probing).

Part I of two part course: Part I covers fundamentals, sorting, and searching, Part II covers graphs, strings, and advanced applications. Prerequisite(s): INFM 241 , INFM 242 , INFM 245 and INFM 246