C/C++ Data Structures

Overview

This C++ Data Structures course provides a practical introduction to the design, implementation, and application of data structures. It begins with the fundamentals and primitive structures like arrays and linked lists, then explores composite structures such as stacks, queues, circular buffers, trees, and hash tables. Learners also examine the role of data structures in embedded systems and conclude with a hands-on project to apply their skills in solving real-world problems. By the end of the course, participants will be equipped to optimize data handling and design efficient algorithms in C++.

Syllabus

Fundamentals of Data Structures and Primitive Data Structures

Explore data structures essentials and primitive data structures like arrays. Learn efficiency concepts, Big-O notation, and implement structures dynamically in C++.

Composite Data Structures: Stacks, Queues, and Circular Buffers

Explore stacks, queues, and circular buffers. Learn their structures, principles like LIFO & FIFO, operations, and real-world applications for managing data efficiently.

Composite Data Structures: Trees and Hash Tables

Explore data structures: binary trees support hierarchical data and fast searching; hash tables provide efficient key-value access. Master properties, operations, and traversal methods.

Data Structures and Embedded Systems

Explore data structures in embedded systems, covering memory constraints, run-time options, optimization for real-time processing, and enhancing system efficiency.