Dynamic Data Structures: Vectors and Linked Lists

Related lectures (25)

Page 1 of 3

Explains the relationship between pointers and arrays in C, focusing on memory management and pointer arithmetic.

Covers stacks, queues, linked lists, and binary search trees in data structures.

Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.

Covers the representation and management of strings in C, highlighting key differences from other programming languages.

Explains pointer arithmetic in C, focusing on memory manipulation and common pitfalls.

Explains dynamic memory allocation in C, focusing on malloc and calloc functions and their differences, including error prevention techniques.

Covers function pointers in C++ and their application in GTKmm for event-driven programming.

Covers the implementation and manipulation of dynamic arrays in C++ using vectors, focusing on their features and performance implications.

Covers flexible array members in C, focusing on dynamic memory allocation and practical applications in system programming.

Covers fundamental programming concepts such as algorithms, variables, and expressions in C++.