Programming Foundations · Comparisons and explanations
Pass by value versus pass by reference
Use C++ integer, reference and pointer examples to distinguish copying an argument value from modifying a shared target.
IntermediateSEARCH LAVACS
Search textbooks, study guides, six encyclopedias, experiments and comparisons.
541 results · page 4 of 23
Programming Foundations · Comparisons and explanations
Use C++ integer, reference and pointer examples to distinguish copying an argument value from modifying a shared target.
IntermediateDeep Learning · Comparisons and explanations
Compare lower-precision values with removing weights or structures, accounting for metadata, execution kernels, and task quality.
IntermediateAI Systems · Comparisons and explanations
Compare runtime evidence retrieval with parameter training through update behavior, authorization, evaluation, and combined designs.
IntermediateDatabases · Comparisons and explanations
Compare PostgreSQL isolation levels through snapshot timing, update conflicts and the anomalies that remain possible.
IntermediateComputer Networks · Comparisons and explanations
Compare recursive resolvers and authoritative servers through delegation, caching, negative answers and practical troubleshooting.
IntermediateDistributed Systems · Comparisons and explanations
Distinguish replicas used for service continuity from backups used for reconstruction, including mistaken changes, retention and tested restoration.
IntermediateDistributed Systems · Comparisons and explanations
Compare sequential consistency and linearizability through register histories, per-client order, real-time precedence and compositional reasoning.
IntermediateDatabases · Comparisons and explanations
Compare transaction serializability with operation linearizability using histories that distinguish atomic grouping from real-time order.
IntermediateComputer Networks · Comparisons and explanations
Distinguish socket objects from port numbers through listening endpoints, accepted connections, addressing and network namespaces.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Track equal-key records to distinguish sorting stability, multi-key ordering, deterministic output and implementation costs.
IntermediateProgramming Foundations · Comparisons and explanations
Distinguish invocation frames from shared objects, then separate references, lifetime, and logical runtime areas from physical optimization.
IntroductoryComputer Networks · Comparisons and explanations
Compare reliability, message boundaries, latency and congestion responsibilities before choosing a transport.
IntermediateOperating Systems · Comparisons and explanations
Compare scheduled threads with asynchronous tasks, distinguishing concurrency, parallelism, blocking work and resource limits.
IntermediateComputer Networks · Comparisons and explanations
Separate encryption, server authentication and client-certificate authentication, then compare authorization and lifecycle requirements for mutual TLS.
IntermediateOperating Systems · Comparisons and explanations
Separate CPU privilege modes, process scheduling and application authority by following a system call and its return.
IntermediateOperating Systems · Comparisons and explanations
Compare address-space-relative locations with physical memory locations through translation arithmetic, sharing and observation limits.
IntermediateDatabases · Comparisons and explanations
Compare a log of changes with a captured base state, and distinguish storage snapshots, backups and MVCC visibility snapshots during recovery planning.
IntermediateDatabases · Concepts and theorems
Use a transfer example to separate atomicity, consistency, isolation, and durability without treating the acronym as one unlimited guarantee.
IntermediateOperating Systems · Concepts and theorems
Separate virtual names, shared physical pages and access permissions with a two-process example.
IntermediateAlgorithms and Data Structures · Concepts and theorems
Analyze dynamic-array growth and a two-stack queue while separating sequence bounds, probabilistic expectations and per-operation latency.
IntermediateConcurrency · Concepts and theorems
Distinguish an indivisible access from an entire multi-step operation that must be coordinated.
IntermediateTransformers and Large Language Models · Concepts and theorems
Separate causal and padding constraints, place masking before softmax, and account for position offsets when a KV cache is present.
IntermediateComputer Networks · Concepts and theorems
Compute an in-flight data budget from bandwidth and RTT, then distinguish receive-window limits from congestion limits.
IntermediateMachine Learning · Concepts and theorems
Compare predictions across repeated training samples and decompose squared prediction error into bias, variance, and observation noise.
Intermediate