Data Structures

The Data Structures Course provides students with a programmer’s arsenal of code and techniques by introducing a variety of ways to manage data and organize programs. Students are reintroduced to core C++ concepts, and extensively examine memory and algorithms dealing with arrays. More complex programming constructs are also explored by looking at the linear, dynamic types, such as Linked Lists, Stacks, Queues, and Heaps. Non-linear dynamic methods such as Hash Tables, Graphs, and Trees are studied in both concept and implementation. The course also looks at software engineering and code organization for large-scale projects in C++, focusing on utilizing Polymorphism and object-based design patterns. The concept of data-driven design is studied through the various projects assigned during the course.

Course Outline

• Program Memory Usage
• Arrays, Dynamic Arrays, and Array Algorithms
• Linked Lists and Linear Data Structures
• Hash Tables
• Trees
• Graphs
• The Standard Template Library
• Tools and Utilities
• Data Compression Techniques
• Data-driven Design