https://www.andrew.cmu.edu/user/icaoberg/notebooks/ Recent content in Notebooks on icaoberg Hugo en-us Sun, 03 May 2026 09:38:29 -0400 https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---circular-queue/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---circular-queue/ Data structures - Circular Queue A circular queue also called a ring buffer is a fixed-capacity queue where the tail wraps around to the front of the underlying array once it reaches the end. This avo https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---doubly-linked-list/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---doubly-linked-list/ Data structures - Doubly Linked List A doubly linked list is a linear data structure where each node stores a value and two pointers — one to the next node and one to the previous node. This bidirecti https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---linked-list/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---linked-list/ Data structures - Linked List A linked list is a linear data structure where each element node stores a value and a pointer to the next node. Unlike arrays, nodes are not stored contiguously in memory https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---priority-queue/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---priority-queue/ Data structures - Priority Queue A priority queue is an abstract data type where each element has an associated priority. Elements are dequeued in priority order — the element with the highest priorit https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---queue/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---queue/ Data structures - Queue A queue is a linear data structure that follows the First-In, First-Out FIFO principle: the first element added is the first one removed — just like a checkout line at a store. https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---splay-tree/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---splay-tree/ Data structures - Splay Tree A splay tree is a self-adjusting binary search tree. Every access search, insert, or delete performs a splay operation that moves the accessed node to the root via a serie https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---stack/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/data-structures---stack/ Data structures - Stack A stack is a linear data structure that follows the Last-In, First-Out LIFO principle: the last element added is the first one removed — just like a stack of plates. This noteb https://www.andrew.cmu.edu/user/icaoberg/notebooks/dask-versus-numpy/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/dask-versus-numpy/ Numerical computing - Dask versus Numpy This notebook benchmarks Dask against NumPy CPU for matrix multiplication and tabular data I/O. The goal is to understand when Dask’s parallel, chunked executio https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-dask/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-dask/ Numerical computing - Intro to Dask Dask is a flexible parallel computing library for Python that scales from a laptop to a cluster. It mirrors the APIs of NumPy, Pandas, and scikit-learn so existing https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-duckdb/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-duckdb/ Numerical computing - Intro to DuckDB DuckDB is an in-process analytical database that runs entirely inside your Python session. It is optimised for OLAP analytical workloads: fast aggregations, scans https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-pandas/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-pandas/ Numerical computing - Intro to pandas Pandas is a fast, powerful, and flexible open-source data analysis library for Python. It provides two core data structures: Series 1-D and DataFrame 2-D table. T https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-polars/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-polars/ Numerical computing - Intro to polars Polars is a blazingly fast DataFrame library written in Rust and exposed to Python via PyO3. It uses Apache Arrow as its memory model, supports lazy evaluation wi https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-requests/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-requests/ Other topics - Intro to requests requests is the most popular Python library for making HTTP calls. It turns a network request into a single, readable function call. This notebook covers: 1. Installat https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-small-worlds/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-small-worlds/ Other topics - Introduction to Small-World Networks A small-world network is a graph in which most nodes are not directly connected, yet any two nodes can be reached by a surprisingly short path — com https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-matplotlib/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-matplotlib/ Visualization - Intro to matplotlib Matplotlibhttps://matplotlib.org/ is the most widely used Python library for creating static, animated, and interactive visualizations. It provides a MATLAB-like pl https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-seaborn/ Sun, 03 May 2026 00:00:00 +0000 https://www.andrew.cmu.edu/user/icaoberg/notebooks/intro-to-seaborn/ Visualization - Intro to seaborn Seabornhttps://seaborn.pydata.org/ is a Python data-visualization library built on top of Matplotlib. It provides a high-level interface for drawing attractive statist