LAVACS KNOWLEDGE
Concepts and theorems
Understand computer science concepts and theorems through definitions, examples, assumptions, and limits.
Concepts and theorems · Intermediate
Calculate entropy for fair, biased and dependent variables, then distinguish uncertainty, lossless compression, cross-entropy and prediction accuracy.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish allocated memory from recently referenced pages and reason about changing workload phases.
Read and check your understanding →Concepts and theorems · Intermediate
Separate virtual names, shared physical pages and access permissions with a two-process example.
Read and check your understanding →Concepts and theorems · Intermediate
Reason about CPU placement, page allocation and bandwidth instead of treating NUMA as one latency number.
Read and check your understanding →Concepts and theorems · Intermediate
Separate virtual allocation from page preparation and distinguish anonymous, file-backed and invalid accesses.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish library calls from kernel requests, including argument validation, return values and partial progress.
Read and check your understanding →Concepts and theorems · Intermediate
Separate instruction count, cycle count and frequency when explaining application performance.
Read and check your understanding →Concepts and theorems · Intermediate
Separate prediction, speculation and retirement when reasoning about branch costs and optimizations.
Read and check your understanding →Concepts and theorems · Intermediate
Count vector width, element width and tail work without assuming that wider vectors guarantee proportional speedup.
Read and check your understanding →Concepts and theorems · Intermediate
Separate atomic access from ordering and analyse publication using a data-and-flag example.
Read and check your understanding →Concepts and theorems · Intermediate
Use neighbouring counters to distinguish logical sharing from cache-line ownership traffic.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish path congestion from receiver capacity and reason about TCP’s amount of data in flight.
Read and check your understanding →Concepts and theorems · Intermediate
Connect TCP’s receive window to application consumption and distinguish a zero window from congestion.
Read and check your understanding →Concepts and theorems · Intermediate
Choose validation boundaries from application requirements rather than assuming that reliable hops imply a completed task.
Read and check your understanding →Concepts and theorems · Intermediate
Relate application messages, TCP bytes, IP packets and link frames without assuming their boundaries coincide.
Read and check your understanding →Concepts and theorems · Intermediate
Track TCP’s two directions and distinguish protocol state from application readiness or remote health.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish predicate fractions from index usefulness using skewed values and combined conditions.
Read and check your understanding →Concepts and theorems · Intermediate
Trace filter and join estimates and explain how row-count errors affect physical execution choices.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish keys, semantic dependencies and accidental patterns with an employee-and-department example.
Read and check your understanding →Concepts and theorems · Intermediate
Use an employee/department decomposition to distinguish BCNF, lossless joining and dependency preservation.
Read and check your understanding →Concepts and theorems · Intermediate
Distinguish commit acknowledgement, WAL, storage and backups while stating the failure scope of durability.
Read and check your understanding →Concepts and theorems · Intermediate
Calculate intersecting replica sets and explain why overlap alone does not prove a linearizable read.
Read and check your understanding →Concepts and theorems · Intermediate
Separate crash, partition and Byzantine assumptions from timing assumptions and reason about timeout evidence.
Read and check your understanding →Concepts and theorems · Intermediate
Calculate Lamport timestamps along a message trace and distinguish clock order from proof of causality.
Read and check your understanding →