Data Structures (SMU)

Data Structures (CSE 2341), a 3rd semester course at SMU, continues to develop students’ understanding of object oriented programming, memory management, and introduces them to basic analysis (big-O) and fundamental data structures such as lists, stacks, queues, binary trees, balanced binary trees, B+ trees, priority queues, and adjacency list representations for graphs.  As time permits, we may cover other topics as well.  The course emphasizes the students’ ability to tackle larger implementation projects and use tools such as debuggers, git and GitHub, and run-time profilers.

Previous semesters’ offerings: