Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Abstract Data Structures and Standard Libraries

Description

This lecture introduces abstract data structures (ADTs) and the standard C++ library. It covers the importance of choosing the right data models for algorithms, the characteristics of ADTs, and the main tools available in the C++ standard library. Topics include linked lists, stacks, queues, associative tables, iterators, and algorithms like sorting. The lecture also explores the use of complex numbers, random number generation, and various functions provided by the library. Practical examples and code snippets are used to illustrate the concepts.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Programming language theory: High-level programming languages

Related concepts (32)

List (abstract data type)

In computer science, a list or sequence is an abstract data type that represents a finite number of ordered values, where the same value may occur more than once. An instance of a list is a computer representation of the mathematical concept of a tuple or finite sequence; the (potentially) infinite analog of a list is a stream. Lists are a basic example of containers, as they contain other values. If the same value occurs multiple times, each occurrence is considered a distinct item.

Linked list

In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. In its most basic form, each node contains data, and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration.

Set (abstract data type)

In computer science, a set is an abstract data type that can store unique values, without any particular order. It is a computer implementation of the mathematical concept of a finite set. Unlike most other collection types, rather than retrieving a specific element from a set, one typically tests a value for membership in a set. Some set data structures are designed for static or frozen sets that do not change after they are constructed.

Data structure

In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data. Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure implements the physical form of the data type.

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output.

Related lectures (44)

Standard Library: Containers and Algorithms

Explores C++ standard library containers and algorithms, including associative tables, stacks, queues, and random number generation.

C++ Standard Library: Containers and Algorithms

Covers the basics of C++ standard library containers, algorithms, and iterators.

C++ Standard Library: Tools Overview

Covers the main tools in the C++ standard library, emphasizing their importance for efficient programming.