Linked list

Formal sciences
Theoretical computer science
Algorithms and data structures
Data structures

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (27)

Page 2 of 3

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.

Polymorphism and Proofs

Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.

Implementing Combiners

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

C++ Standard Library: Tools Overview

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

Union-Find and Minimum Spanning Trees

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

Collections: Introduction

Covers the basics of collections in Java, including sets, keys, values, duplicates, order, and access methods.

Hash Tables Analysis

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

Pointers and Arrays: Understanding sizeof in C

Explains the sizeof operator in C, focusing on its use with pointers and arrays, and highlights common pitfalls and errors in its application.

Pointers and Arrays: Memory Management in C

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

Implementation of Sets: Part I

Covers the implementation of inheritable classes for simplified sets in Java.