Govt. Exams
Entrance Exams
3NF removes transitive dependencies where non-key attributes depend on other non-key attributes. BCNF is stricter but 3NF eliminates transitive dependencies.
LRU cache requires O(1) access and O(1) removal/insertion of least-used items. Hash Map provides O(1) lookup, and Doubly Linked List maintains order efficiently.
Training data is used to teach AI models to recognize patterns. Test data evaluates accuracy; validation data prevents overfitting.
The query optimizer analyzes different execution strategies and selects the one with minimal resource consumption and execution time.
Merge Sort and Quick Sort have O(n log n) average complexity. Merge Sort guarantees this; Quick Sort can degrade to O(n²) in worst case.
Encryption converts data into unreadable format, protecting it from unauthorized access during transmission and storage.
Indexes speed up data retrieval by creating optimized lookup structures, reducing the number of disk accesses needed to find data.
IaaS provides infrastructure resources (compute, storage, networking). SaaS provides applications, PaaS provides development platforms.
INNER JOIN returns only rows with matches in both tables. LEFT JOIN returns all rows from the left table plus matching rows from the right table.
A heap (binary heap) efficiently implements priority queues with O(log n) insertion and deletion of minimum/maximum elements.
