Method systematically trying possible solutions.

Tree where each node has at most two children.

Binary tree maintaining an ordered search property.

Balanced tree optimized for storage systems.

B-tree variant commonly used for database indexes.

Storage location containing hash-table entries.

Search algorithm repeatedly dividing a sorted range.

Graph traversal exploring neighboring nodes level by level.

Algorithm finding shortest paths while allowing negative edges.

Simple sorting algorithm repeatedly swapping adjacent elements.

Sorting algorithm distributing elements into buckets.

Graph whose vertices can be divided into two independent sets.

JavaScript compiler and transformation tool.

Tool combining modules into deployable files.

Automatic Python code formatter.

Python's true/false data type.

Immutable sequence of bytes.

Mutable sequence of bytes.

JVM process checking bytecode safety and validity.

.NET web UI framework using C#.

Explicit boundary around a domain model.

Rules implementing business behavior.

Scope of impact caused by a failure.

Isolating resources to limit failure propagation.

Backend designed specifically for a particular frontend.

Chart showing remaining work over time.

Chart showing completed work toward a target.

List of pending work items.

Expressing software behavior in business-readable scenarios.

Requirement representing a business objective or need.

Software components operating behind the user interface.

Ability to work with older versions or formats.

Copy of data maintained for recovery purposes.

Software used to copy and restore data.

Maximum data transfer capacity of a connection.

File containing commands executed sequentially.

Processing jobs together without continuous user interaction.