When does data become information?
Data becomes information when it is organized and interpreted in a meaningful context.
Study 10 — Data, Systems, and Applications with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
When does data become information?
Data becomes information when it is organized and interpreted in a meaningful context.
What does a DBMS provide?
A database management system (DBMS) is software used to create, query, protect, and maintain a database.
What uniquely identifies each row in a table?
A primary key uniquely identifies each row in a relational table.
What does a foreign key reference?
A foreign key is a reference to a key identifying a row in another table.
What does a database query abstract away?
A query states what information is needed; the DBMS determines how to find it, using methods such as indexes or join algorithms.
What is the purpose of normalization?
Normalization separates data into related tables to reduce unnecessary duplication and update problems.
What does atomicity guarantee?
Atomicity means a transaction’s operations all occur, or none occur.
How does an inverted index support text search?
An inverted index maps each term to the documents in which it appears, using postings lists of matching document identifiers.
What does precision measure?
Precision is the proportion of returned results that are relevant.
What does recall measure?
Recall is the proportion of all relevant results that are returned.
What does an API contract specify?
An API contract specifies available operations, accepted inputs, produced outputs, and possible errors or side effects.
What is an abstraction layer?
An abstraction layer provides services to the layer above while relying on services from the layer below.
A 14-question medium-difficulty quiz on Boolean algebra, logic gates, truth tables, and combinational circuits.
Learn how computer memory stores and addresses information, how RAM and ROM differ, and how caches and the memory hierarchy balance speed, capacity, and cost.
A 14-question quiz on trees, binary trees, traversals, recursive algorithms, and binary search trees. The questions progress from foundational concepts to applied reasoning about structure, complexity, and BST operations.
A progressive guide to tree structure, binary-tree traversals, binary search tree operations, deletion, balancing, and the way tree height determines time and space costs.
Learn how to choose, structure, document, and maintain software documentation for users, developers, integrators, and operators.
A structured guide to comparison-based sorting algorithms, their complexity, stability, memory use, and practical selection criteria.
Reviews how interrupts support event handling and multitasking, and how Linux system calls use the RISC-V `ecall` instruction and register conventions.
This quiz covers process management, context switching and scheduling, multitasking, traps and interrupts, and RISC-V privilege transitions.
A quiz on operating-system system calls, including privileged-operation requests, process creation and execution with fork, exec, and waitpid, and signal handling.