Elementary Data Structures: Stacks, Queues, Linked Lists

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (22)

Page 1 of 3

Data Structures: Stacks, Queues, Linked Lists

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

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.

Dynamic Data Structures: Vectors and Linked Lists

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

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.

Implementing Combiners

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

MIPS Assembly: Function Calls & Memory Management

Explores MIPS assembly language, covering function calls, memory management, and data structures, including recursive functions, programming constructs, arrays, and linked lists.

Synthesis of Safe Pointer-Manipulating Programs

Introduces SuSLik, a program synthesizer generating safe low-level programs from logical specifications, showcasing its capabilities in handling linked data structures.

Abstract Data Structures and Standard Libraries

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

Pointers and Arrays: Memory Management in C

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

Union-Find and Minimum Spanning Trees

Covers the Union-Find data structure and Minimum Spanning Trees.