Concepts and theorems · Intermediate
Locality of reference: closeness in time and space
Distinguish reuse of the same data from access to nearby data, and predict when a cache can help.
Read and check your understanding →LAVACS KNOWLEDGE
Understand computer science concepts and theorems through definitions, examples, assumptions, and limits.
78 articles · page 1 of 4
Concepts and theorems · Intermediate
Distinguish reuse of the same data from access to nearby data, and predict when a cache can help.
Read and check your understanding →Concepts and theorems · Intermediate
Work through address translation, then separate process identity, protection, shared pages, TLB misses and page faults.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish demand allocation, copy-on-write, and protection failures instead of equating every fault with a disk read.
Read and check your understanding →Concepts and theorems · Intermediate
Separate translation-cache misses, page-table walks, and page faults, and reason about translation reach.
Read and check your understanding →Concepts and theorems · Intermediate
Trace parent and child values across fork, distinguishing shared backing pages, private writes, deferred copying and memory-accounting limits.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish a descriptor number, an open file description, and the underlying file before reasoning about sharing.
Read and check your understanding →Concepts and theorems · Intermediate
Understand restricted instructions, controlled trap entry, and why a privilege transition is not necessarily a process switch.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish an indivisible access from an entire multi-step operation that must be coordinated.
Read and check your understanding →Concepts and theorems · Intermediate
Build a partial order from local order, communication, and transitivity rather than inferring causality from timestamps.
Read and check your understanding →Concepts and theorems · Advanced
Place each operation between its invocation and response while preserving real-time precedence and the object sequential specification.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish coordination of cached copies of one location from ordering constraints across different locations.
Read and check your understanding →Concepts and theorems · Intermediate
Separate a numeric value from its byte representation when reading memory, packets, and binary formats.
Read and check your understanding →Concepts and theorems · Intermediate
Use four-byte alignment to distinguish address requirements, padding, and architecture-dependent unaligned access behavior.
Read and check your understanding →Concepts and theorems · Intermediate
Understand why keeping old row versions supports snapshots without eliminating every lock or anomaly.
Read and check your understanding →Concepts and theorems · Advanced
Use a write-skew example to test whether a concurrent outcome matches any permitted serial transaction order.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish foreign-key validation, delete actions, null handling, and indexing when connecting related tables.
Read and check your understanding →Concepts and theorems · Intermediate
Use a transfer example to separate atomicity, consistency, isolation, and durability without treating the acronym as one unlimited guarantee.
Read and check your understanding →Concepts and theorems · Intermediate
Prove initialization, preservation, and the exit result for an array sum, then check termination separately.
Read and check your understanding →Concepts and theorems · Introductory
Define an asymptotic upper bound and distinguish it from a tight bound, a worst-case choice, and a wall-clock prediction.
Read and check your understanding →Concepts and theorems · Intermediate
Separate path capacity from round-trip delay, then reason about sequential waits and retransmission timers.
Read and check your understanding →Concepts and theorems · Intermediate
Compute an in-flight data budget from bandwidth and RTT, then distinguish receive-window limits from congestion limits.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish link MTU, path MTU, and TCP MSS, including header overhead, tunnels, and discovery failures.
Read and check your understanding →Concepts and theorems · Intermediate
Use operation histories to distinguish sequential consistency, linearizability, and eventual convergence.
Read and check your understanding →Concepts and theorems · Intermediate
Analyze dynamic-array growth and a two-stack queue while separating sequence bounds, probabilistic expectations and per-operation latency.
Read and check your understanding →Use the knowledge map to find prerequisites, or follow a learning path in order.