A heap (min-heap or max-heap) efficiently supports priority queue operations with O(log n) insertion and deletion.
B-Tree maintains balanced structure ensuring O(log n) search, insert, and delete operations, commonly used in databases.
INNER JOIN returns only the records that have matching values in both tables, filtering out non-matching rows.
AES is the current NIST standard for symmetric encryption with key sizes of 128, 192, or 256 bits. DES is deprecated due to weak key size.
Constant O(1) is fastest, followed by logarithmic O(log n), linear O(n), quadratic O(n²), exponential O(2ⁿ), and factorial O(n!) which is slowest.
Deadlock is a situation where multiple processes cannot proceed because each holds resources needed by others, creating a circular wait condition.
MongoDB's document-based model allows flexible schemas for unstructured data and supports horizontal scaling, unlike rigid relational schemas.
Overfitting occurs when a model learns the training data including its noise and irregularities, performing poorly on unseen test data.
A tree is a special case of a graph with no cycles. It has n nodes and n-1 edges, forming a hierarchical structure.
COMMIT saves all changes made during the current transaction to the database permanently. Until COMMIT, changes can be rolled back using ROLLBACK.