Students learn basic and essential topics in data structures, including array-based lists, linked lists, skiplists, hash tables, recursion, binary trees, scapegoat trees, red–black trees, heaps, sorting algorithms, graphs, and binary tree. Students through the analysis and design of fundamental data structures learn to use data structures as algorithmic tools to design efficient computer programs that will cope with complex applications. Data structure topics include the application, implementation, and complexity analysis of trees, hash tables, heaps, maps, sets, and graphs. Algorithmic topics include advanced sorting and searching methods and an introduction to divide-and-conquer and greedy techniques, graph algorithms, backtracking, and dynamic programming.
Course Code: CS 2500
Credit Hours: 3
Level: Lower-Level
Program Placement: Semester IV
Course description sourced verbatim from the official Northwood University 2025–2026 Academic Catalog and program curriculum guide. Northwood reserves the right to revise course content between publications.