Q&A Hero

Humanities

Q: Distributed database systems do not require complex mechanisms to manage transactions and ensure the database's consistency and integrity.
Q: A distributed database system requires functional characteristics that can be grouped and described as transparency features.
Q: A transaction processor is the software component residing on each computer that stores and retrieves data located at the site.
Q: A DDBMS must be communications-media-dependent.
Q: The TP is the software component found in each computer that requests data.
Q: A fully distributed DBMS must perform all the functions of a centralized DBMS, and it must handle all necessary functions imposed by the distribution of data and processing.
Q: A DBMS must have validation, transformation, and mapping functions, as well as other functions, in order to be classified as distributed.
Q: Both distributed processing and distributed databases require a network to connect all components.
Q: In order to manage distributed data, copies or parts of the database processing functions must be distributed to all data storage sites.
Q: Distributed processing does not require a distributed database, and a distributed database does not require distributed processing.
Q: The inherently complex distributed data environment increases the urgency for standard protocols governing transaction management.
Q: Distributed processing shares the database's logical processing among two or more physically independent sites that are connected through a network.
Q: Current DDBMSs are subject to some problems, such as the complexity of management and control.
Q: One of the advantages of a DDBMS is security.
Q: One of the advantages of a DDBMS is improved communication.
Q: One of the advantages of a DDBMS is growth facilitation.
Q: One of the advantages of a DDBMS is that the data is located near the site with the least demand.
Q: The World Wide Web (the Web) is the repository for distributed data.
Q: A DDBMS governs the storage and processing of logically related data over interconnected computer systems.
Q: From a system functionality point of view, ____ attribute values can be calculated when they are needed to write reports or invoices.a. derived b. atomic c. granulard. historical
Q: Granularity refers to ____. a. the size of a table b. the level of detail represented by the values stored in a table's row c. the number of attributes in a table d. the number of rows in a table
Q: The most likely data type for a surrogate key is ____.a. Character b. Date c. Logicald. Numeric
Q: An atomic attribute ____.a. cannot exist in a relational table b. cannot be further subdivided c. displays multiplicityd. is always chosen to be a foreign key
Q: Improving ____ leads to more flexible queries.a. atomicity b. normalization c. denormalizationd. derived attributes
Q: According to naming conventions described in Chapter 2, ____ would be the best name for a column representing the charges per hour in a table named JOB.a. JOB_CHG_HOUR b. CHARGES_PER_HOUR_FOR_JOB c. CHARGES_PER_HOURd. CHG_HR
Q: A table that is in 2NF and contains no transitive dependencies is said to be in ____.a. 1NF b. 2NF c. 3NFd. 4NF
Q: If a table has multiple candidate keys and one of those candidate keys is a composite key, the table can have ____ based on this composite candidate key, even when the primary key chosen is a single attribute.a. Boyce-Codd Normal Form b. redundancy c. time-varianced. partial dependencies
Q: Before converting a table into 3NF, it is imperative the table already be in ____.a. 1NF b. 2NF c. 4NFd. BCNF
Q: If you have three different transitive dependencies, ____ different determinant(s) exist.a. one b. two c. threed. four
Q: A table that is in 1NF and includes no partial dependencies is said to be in ____.a. BCNF b. 2NF c. 3NFd. 4NF
Q: A table that has all key attributes defined, has no repeating groups, and all its attributes are dependent on the primary key, is said to be in ____.a. 1NF b. 2NF c. 3NFd. 4NF
Q: In a(n) ____ diagram, the arrows above the attributes indicate all desirable dependencies.a. Chen b. dependency c. functionalityd. ER
Q: Dependencies based on only a part of a composite primary key are called ____ dependencies.a. primary b. partial c. incompleted. composite
Q: A relational table must not contain a(n) ____.a. entity b. attribute c. relationshipd. repeating group
Q: A ____ derives its name from the fact that a group of multiple entries of the same type can exist for any single key attribute occurrence.a. partial dependency b. transitive dependency c. repeating groupd. primary key
Q: Attribute A ____ attribute B if all of the rows in the table that agree in value for attribute A also agree in value for attribute B.a. determines b. derives from c. controlsd. owns
Q: A(n) ____ exists when there are functional dependencies such that Y is functionally dependent on X and Z is functionally dependent on Y, and X is the primary key.a. partial dependency b. repeating group c. atomic attributed. transitive dependency
Q: Of the following normal forms, ____ is mostly of theoretical interest.a. 1NF b. 3NF c. BCNFd. DKNF
Q: Some very specialized applications may require normalization beyond the ____.a. 1NF b. 2NF c. 3NFd. 4NF
Q: Data redundancy produces ____.a. slower lookups b. robust design c. efficient storage used. data integrity problems
Q: A table that displays data redundancies yields ____.a. consistencies b. anomalies c. fewer attributesd. more entities
Q: An attribute that is part of a key is known as a(n) ____ attribute.a. important b. nonprime c. primed. entity
Q: ____ yields better performance.a. Denormalization b. Normalization c. Atomizationd. Compression
Q: From a structural point of view, 2NF is better than ____.a. 1NF b. 3NF c. 4NFd. BCNF
Q: 1NF, 2NF, and 3NF are ____.a. normalization stages b. anomalies c. repeating groupsd. atomic attributes
Q: Normalization works through a series of stages called normal forms. For most purposes in business database design, ____ stages are as high as you need to go in the normalization process.a. twob. three c. fourd. five
Q: Attributes should clearly define participation, connectivity, and document cardinality.
Q: Unnormalized database tables often lead to various data redundancy disasters in production databases.
Q: Normalization purity is easy to sustain in the modern database environment.
Q: The advantage of higher processing speed must be carefully weighed against the disadvantage of data anomalies.
Q: A good relational DBMS excels at managing denormalized relations.
Q: The combination of normalization and ER modeling yields a useful ERD, whose entities may now be translated into appropriate relationship structures.
Q: Normalization represents a micro view of the entities within the ERD.
Q: Normalization should be part of the design process.
Q: Atomic attributes are attributes that can be further subdivided.
Q: A dependency of one nonprime attribute on another nonprime attribute is a partial dependency.
Q: A determinant is any attribute whose value determines other values within a column.
Q: It is possible for a table in 2NF to exhibit transitive dependency, where the primary key may rely on one or more nonprime attributes to functionally determine other nonprime attributes.
Q: A table is in 2NF if it is in 1NF and it includes no partial dependencies.
Q: Because a partial dependency can exist only if a table's primary key is composed of several attributes, if a table in 1NF has a single-attribute primary key, then the table is automatically in 2NF.
Q: Converting a database format from 1NF to 2NF is a complex process.
Q: With partial dependencies, data redundancies occur because every row entry requires duplication of data.
Q: All relational tables satisfy the 1NF requirements.
Q: Dependencies that are based on only a part of a composite primary key are called transitive dependencies.
Q: Dependency diagrams are very helpful in getting a bird's-eye view of all the relationships among a table's attributes.
Q: Repeating groups must be eliminated by making sure that each row defines a single entity.
Q: Relational models view the data as part of a table or collection of tables in which all key values must be identified.
Q: A table is in fourth normal form if it is in third normal form and has no independent multivalued dependencies.
Q: A table is in BCNF if every determinant in the table is a foreign key.
Q: A table is in BCNF if every determinant in the table is a candidate key.
Q: Normalization is a very important database design ingredient and the highest level is always the most desirable.
Q: Denormalization produces a lower normal form.
Q: In order to meet performance requirements, you may have to denormalize portions of the database design.
Q: Normalization is a process that is used for changing attributes to entities.
Q: Normalization produces a lower normal form.
Q: Normalization works through a series of stages called normal forms.
Q: Explain how database designers design and normalize databases.
Q: Explain the Boyce-Codd normal form (BCNF). How is it related to other normal forms?
Q: What steps are involved in the conversion to third normal form?
Q: Describe a dependency diagram and explain its purpose.
1 2 3 … 391

Subjects

Accounting Anthropology Archaeology Art History Banking Biology & Life Science Business Business Communication Business Development Business Ethics Business Law Chemistry Communication Computer Science Counseling Criminal Law Curriculum & Instruction Design Earth Science Economic Education Engineering Finance History & Theory Humanities Human Resource International Business Investments & Securities Journalism Law Management Marketing Medicine Medicine & Health Science Nursing Philosophy Physic Psychology Real Estate Science Social Science Sociology Special Education Speech Visual Arts