An introduction to data structures and algorithms and the mathematics needed to analyze their time and space complexity. Topics include asymptotic notation, recurrence relations and their solution, sorting, hash tables, priority queues, search trees (including at least one balanced tree structure), and basic graph representation and search. Students complete a term project that includes an experimental assessment of competing data structures.
News & Events | People | Academics | Research | Jobs | Companies | Visitors | Computer Facilities | Home
