What is a relational table?
A relational table, or relation, organizes information into rows and columns.
Study Relational Tables and Keys with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is a relational table?
A relational table, or relation, organizes information into rows and columns.
What is a row in a relational table called?
Rows in a relational table are called tuples.
What is a column in a relational table called?
Columns in a relational table are called attributes.
What is defined for each column in a relational table?
Each column in a relational table has a defined type.
What role does a primary key play?
A primary key identifies rows in a table.
What role does a foreign key play?
A foreign key links rows between tables.
In a relational table, what are the terms for rows and columns?
Rows are tuples; columns are attributes.
What two parts make up a relational table?
A table consists of rows, also called tuples, and columns, also called attributes.
How do the roles of primary and foreign keys differ?
A primary key identifies rows; a foreign key links rows between tables.
Which kind of key identifies rows in a table?
The primary key identifies rows in a table.
Which kind of key links rows between tables?
The foreign key links rows between tables.
Which are tuples: rows or columns?
Rows are the table's tuples, while columns are its attributes.
A progressive guide to how computers encode numbers, text, images, and sound as binary data, including the trade-offs and limits of digital representation.
A 14-question medium-difficulty quiz on Boolean algebra, logic gates, truth tables, and combinational circuits.
A focused set of flashcards covering Python variables, data types, expressions, control flow, functions, input, output, and common programming practices.
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 progressive guide to tree structure, binary-tree traversals, binary search tree operations, deletion, balancing, and the way tree height determines time and space costs.
A progression through how data is organized, searched, exposed through software interfaces, and managed through abstraction layers in modern computer systems.
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.