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

Concept

Queue (abstract data type)

Related lectures (22)

Stacks and Queues: Implementation and Efficiency

Explores the implementation and efficiency of stacks and queues, along with an algorithmic challenge involving train order determination.

Data Structures: Stacks, Queues, Linked Lists

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

Algorithms Exam Preparation

Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.

Amortized Conc-Tree Appends

Explores constant time appends in Conc-Trees and counting in a binary number system.

Stainless Verification System Tutorial

Introduces Stainless, an open-source tool for verifying Scala programs, covering language, modeling, verification tips, and inner workings.

Implementation of Singly Linked Lists

Covers the implementation of singly linked lists in Java, focusing on concepts such as nodes, size management, adding, removing, and getting elements.

Dynamic Data Structures: Vectors and Linked Lists

Covers the comparison between vectors and linked lists in C++ programming.

Infinite Sequences: Laziness

Covers lazy lists, infinite sequences, prime numbers, and list processing challenges.

Standard Library: Containers and Algorithms

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

Functional Data Structures: Collections and Operations

Covers functional data structures and their relationships, implementations, and efficiency.

Linked Lists: Implementation and Iteration

Covers the implementation of linked lists in Java, focusing on operations and testing.

Lazy Evaluation: Lazy Lists

Explores lazy evaluation and lazy lists in Scala, emphasizing their benefits and implementation.

C++ Standard Library: Containers and Algorithms

Explores containers and algorithms in the C++ standard library, including find, copy, and sort functionalities.

Lazy Lists: Delayed Evaluation and Efficient Computation

Covers Lazy Lists, delaying computation for efficiency in combinatorial search.

Hash Tables Analysis

Covers the analysis of hash tables, including search operations and expected collisions.

Data Abstraction: Modules and Specifications in Coq Log in to Mediaspace to watch this video

Discusses data abstraction in programming, focusing on modules and specifications in Coq.

Universal Constructions: Consensus and Shared Memory Models Log in to Mediaspace to watch this video

Explores universality, consensus objects, shared memory models, and FIFO Queue implementation.

Abstract Data Structures and Standard Libraries Log in to Mediaspace to watch this video

Covers abstract data structures and the C++ standard library, including linked lists, stacks, queues, and complex numbers.

Elementary Data Structures: Stacks, Queues, Linked Lists Log in to Mediaspace to watch this video

Covers stacks, queues, and linked lists, emphasizing efficiency and dynamic structures.

Binary Search Trees: Implementation and Operations Log in to Mediaspace to watch this video

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