Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Queue (abstract data type)
Formal sciences
Theoretical computer science
Algorithms and data structures
Data structures
Related lectures (22)
Graph Chatbot
Login to filter by course
Login to filter by course
Reset
Previous
Page 2 of 3
Next
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.
Binary Search Trees: Implementation and Operations
Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.
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.
Graph Algorithms: BFS and DFS
Explores graph algorithms like BFS and DFS, discussing shortest paths, spanning trees, and data structures' role.
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.