CPTR 424 Review 2 correctly answered graded A+ passed

CPTR 424 Review 2A diagram that shows what privileges have been given to users is called a(n) A. authorization graph B. access control matrix C. wait-for graph D. DBA view A. authorization graph A functional dependency is actually a _______ relationship from attribute set A to attribute set B. A. one-to-one B. recursive C. many-to-many D. many-to-one D. many-to-one A hardware or software barrier that protects an intranet from unauthorized access is a(n) A. access control matrix B. secure socket layer C. cipher system D. firewall D. firewall A logical unit of work on the database is a(n) A. program B. retrieval C. update D. transaction D. transaction A relation is Boyce-Codd Normal Form if A. every superkey is a candidate key B. every determinant is a superkey C. every candidate key is a primary key D. it has overlapping candidate keys B. every determinant is a superkey A relation is in _______ normal form (1NF) if, and only if, every attribute is single-valued for each tuple. A. first B. second C. third D. Boyce-Codd A. first A situation when node or line failure causes a network to be split into groups with no inter-group communication is called A. network failure B. network replication C. network synchronization D. network partitioning D. network partitioning A unidirectional or bidirectional relationship between mutually independent classes in UML diagrams is called A. aggregation B. linking C. association D. reflexive relationship C. association A user view in which the WHERE line of the SELECT statement used to create the view contains some predicate is called A. value-dependent B. value-independent C. dynamic D. static A. value-dependent All of the following are factors the designer of a distributed database should consider EXCEPT A. data placement B. types of applications C. type of user interface D. type of communication system C. type of user interface All of the following are reasons for leaving a schema in a lower normal form except A. Desire to keep related items together in the same relation B. Performance requirements C. Desire to preserve functional dependencies in the same relation D. Desire to reduce replication D. Desire to reduce replication All of the following are used as multiplicity indicators in UML except A. 1 B. M C. 0..1 D. 0..* B. M All of the following signal an end of an Oracle transaction EXCEPT A. a COMMIT statement B. a SAVEPOINT C. a ROLLBACK statement D. a DDL command B. a SAVEPOINT An access control matrix is a means of implementing A. authorization B. authentication C. integrity checking D. database constraints A. authorization An assumption for the three-phase commit protocol for transaction management in distributed database systems is that A. at least half the nodes are operational B. there is no network partitioning C. the coordinator has not failed D. no node has failed B. there is no network partitioning Assume we have a type hierarchy in Oracle with PersonType as the base type, EmployeeType as a subtype of PersonType, and ProgrammerType as a subtype of EmployeeType. All objects are stored in a substitutable table called Persons. To limit a query to the base type, Person, without including Employees, use A. SELECT VALUE(p) FROM Persons p; B. SELECT VALUE(p) FROM Persons p WHERE value(p) IS OF (PersonType); C. SELECT PersonType(p) FROM Persons p ; D. SELECT VALUE(p) FROM Persons p WHERE value(p) IS OF (ONLY PersonType); D. SELECT VALUE(p) FROM Persons p WHERE value(p) IS OF (ONLY PersonType); At a checkpoint, all of the following operations are performed except A. writing all log records from main memory to disk B. writing all modified database buffer blocks to disk C. writing a record identifying all transactions that committed since the last checkpoint D. writing a checkpoint record identifying all active transactions C. writing a record identifying all transactions that committed since the last checkpoint Deadlock detection in a distributed environment requires A. a resource allocation graph B. a conflict resolution graph C. a query tree D. a global wait-for graph D. a global wait-for graph Deadlock occurs when A. two transactions share read locks B. two transactions each wait for a lock held by the other C. a transaction waits for another to release an exclusive lock D. a transaction waits for another to release a shared lock B. two transactions each wait for a lock held by the other For a relational decomposition, the property of being able to get back exactly the original relation by joins is A. lossless decomposition B. dependency preservation C. attribute preservation D. relation preservation A. lossless decomposition For a schedule to be serializable it must A. performs transactions serially B. not allow two transactions any type of concurrent access to the same data items C. produce the same result as an actual serial execution D. lock the data items required by each transaction C. produce the same result as an actual serial execution If a relation is 3NF but not BCNF, it must have a non-trivial functional dependency X → A such that A. the primary key does not determine X B. X is not a superkey C. A is not a superkey D. the primary key does not determine A B. X is not a superkey If set S{A,B,C} is a candidate key for the relation R(A,B,C,D,E), then which of the following must be true A. {A,B,D} must also be a candidate key for R B. {A,B} or {A,C} or {B,C} must also be a candidate key for R C. {A,B,C,D} must also be a candidate key for R D. none of these D. none of these