Giving users or processes only required permissions.

Time required for data to travel between endpoints.

Local-area network.

Process selecting one system component as coordinator.

Deliberately rejecting work to protect a system under overload.

Processes continuously change state but make no progress.

Open-source Unix-like operating-system kernel.

Interactive command for viewing text.

Utility for quickly searching indexed filenames.

Operator combining or negating logical conditions.

Period during which a variable or object exists.

Binding performed during runtime.

Tool identifying potential code-quality or style problems.

Recording program events for diagnosis or auditing.

Runtime grows proportionally with input size, typically O(n).

Runtime grows logarithmically with input size.

Sequence of nodes connected through references.

Hash structure maintaining insertion or access ordering.

Search algorithm checking elements sequentially.

Tree traversal visiting nodes level by level.

Scope determined by source-code structure.

Loading resources only when they are needed.

Concise syntax for constructing lists.

Small anonymous function.

Java list implementation using linked nodes.

Concise syntax for anonymous functions in Java.

Java library generating boilerplate code through annotations.

Expression referring to an identifiable object or location.

Anonymous function expression in C++.

Rules determining whether identifiers refer to the same entity.

Error occurring while combining compiled components.

.NET language-integrated query technology.

Selecting one node as a coordinator.

Time-limited permission to hold a resource or role.

Older software still in use.

Updating or replacing older software systems.

Approach emphasizing waste reduction and fast learning.