Exam 3: The Relational Database Model
Exam 1: Database Systems76 Questions
Exam 2: Data Models75 Questions
Exam 3: The Relational Database Model75 Questions
Exam 4: Entity Relationship Er Modeling75 Questions
Exam 5: Advanced Data Modeling85 Questions
Exam 6: Normalization of Database Tables110 Questions
Exam 7: Introduction to Structured Query Language Sql111 Questions
Exam 8: Advanced Sql109 Questions
Exam 9: Database Design103 Questions
Exam 10: Transaction Management and Concurrency Control85 Questions
Exam 11: Database Performance Tuning and Query Optimization85 Questions
Exam 12: Distributed Database Management Systems83 Questions
Exam 13: Business Intelligence and Data Warehouses75 Questions
Exam 14: Database Connectivity and Web Technologies85 Questions
Exam 15: Database Administration and Security86 Questions
Select questions type
The DIFFERENCE operator subtracts one table from the other.
Free
(True/False)
4.8/5
(33)
Correct Answer:
True
A is any key that uniquely identifies each row.
Free
(Multiple Choice)
5.0/5
(28)
Correct Answer:
A
When two or more tables share the same number of columns, and when their corresponding columns share the same or compatible domains, they are said to be .
Free
(Multiple Choice)
4.8/5
(33)
Correct Answer:
B
According to Codd's rule of relational database, "Application programs and ad hoc facilities are logically unaffected when changes are made to the table structures that preserve the original table values (changing order of columns or inserting columns)."
(Multiple Choice)
4.7/5
(31)
A key can be described as a minimal superkey, a superkey without any unnecessary attributes.
(Multiple Choice)
4.9/5
(33)
relationships can be implemented by creating a new entity in 1:M relationships with the original entities.
(Multiple Choice)
4.8/5
(27)
If one department chair-a professor-can chair only one department, and one department can have only one department chair. The entities PROFESSOR and DEPARTMENT exhibit a(n) relationship.
(Short Answer)
4.8/5
(29)
A(n) join links tables by selecting only the rows with common values in their common attribute(s).
(Multiple Choice)
4.8/5
(35)
One characteristic of generalization hierarchies is that they are implemented as relationships.
(Short Answer)
4.9/5
(25)
is the real power behind the relational database, allowing the use of independent tables linked by common attributes.
(Short Answer)
4.8/5
(39)
relationships cannot be implemented as such in the relational model.
(Short Answer)
4.8/5
(35)
The idea of determination is unique to the database environment.
(True/False)
4.9/5
(37)
In a database context, the word indicates the use of the same attribute name to label different attributes.
(Multiple Choice)
4.8/5
(28)
A(n) index is an index in which the index key can have only one pointer value (row) associated with it.
(Short Answer)
4.8/5
(35)
PRODUCT yields all possible pairs of rows from two tables, also known as the product.
(Short Answer)
4.8/5
(32)
A data dictionary is sometimes described as "the database designer's database" because it records the design
decisions about tables and their structures.
(True/False)
5.0/5
(32)
A table is also called a(n) because the relational model's creator, E. F. Codd, used the two terms as synonyms.
(Short Answer)
4.8/5
(33)
Showing 1 - 20 of 75
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)