Chapter 1: Linear Data Structures & Memory Models

The simplest data structures that everything else builds on: arrays, linked lists, stacks, queues, deques, hash tables, and bit-level structures.

• Dynamic Arrays, Memory Allocation, Custom Allocators, Cache Locality, and Amortized Analysis
• Linked Lists (Singly, Doubly, Skip Lists)
• Stacks, Queues, Deques, Ring/Circular Buffers, and Call Stack Mechanics (Tail-Call Optimization, Recursion Frames)
• Hash Tables: Hash Functions, Collision Resolution, Universal Hashing, and In-Memory Key-Value Storage
• Bitwise Algorithms, Bitsets, Bloom Filters, and Probabilistic Counting (HyperLogLog, Count-Min Sketch)
• Expression Evaluation: Reverse Polish Notation (RPN), Shunting-Yard Algorithm, and Stack Calculators
• Data Compression Algorithms & Archival Formats: Lossless Compression (Huffman Coding, LZW, LZ77/LZ78, Deflate), Container Formats (ZIP, RAR, LZH, 7Z), and Compression Ratios
• Chapter 1 References