17 docs tagged with "computer-science"

A map for analyzing algorithms, recognizing design patterns, and choosing an appropriate problem-solving family.

Contiguous indexed storage, resizing, amortized append, and shifting costs.

Understand search-tree queries, rotations, and successor deletion, then use red-black invariants to bound height and compare ordered containers.

A compact map of the durable ideas that sit underneath programming languages, frameworks, and AI systems.

Choose a starting point for algorithm costs, data structures, Python programming, and testing.

A representation-first map for choosing containers by operations, invariants, and memory behavior.

A foundation map for logic, proof, counting, discrete structures, and probability in computer science.

Follow a hostname through resolution and an HTTP response, understand ports, certificates, proxies, and localhost, and diagnose failures by layer.

Compare storage and operation costs on one small graph, handle duplicates, self-loops, and isolated vertices, and choose a representation for each algorithm.

Understand key constraints, collision handling, load, and expected and amortized costs through a trace with deletion and rebuilding.

A comparison of contiguous sequences, linked nodes, stacks, and queues.

Node-linked sequences, local splicing, traversal costs, and ownership invariants.

How processes run, use virtual memory, inherit resources, and differ from containers and virtual machines.

A compact map of the maintained language notes on this site and how to choose what to learn next.

FIFO processing through deques, linked endpoints, and circular buffers.

Use orders and inventory to connect tables, keys, joins, NULL, constraints, indexes, concurrent transactions, and external side effects.

The LIFO interface, implementation choices, and algorithmic invariants it expresses.