Q.) Which following statements about B+trees and ISAM trees is true? (choose only one) O a) A B+Tree will rebalance itself after data insertions/deletions. ISAM trees do not re- balance. O b) B+Trees...

Extracted text: Q.) Which following statements about B+trees and ISAM trees is true? (choose only one) O a) A B+Tree will rebalance itself after data insertions/deletions. ISAM trees do not re- balance. O b) B+Trees have, on average, a larger branching factor than ISAM trees, hence they are more efficient at indexing data on disk. O c) B+Trees support range queries, ISAM trees do not. O d) B+Trees are optimized for disk storage, ISAM trees are optimized for main memory storage. O e) B+Trees can perform a lookup query in O(1) time. ISAM trees cannot. Q..) What is so bad about non-recoverable schedules? (choose only one) O a) Non-recoverable schedules are likely to incur into high lock contention. O b) Nothing, as long as conflict-serializability is enforced. O c) Non-recoverable schedules write too many entries in the transaction log, making recovery impractical. O d) A non-recoverable schedule may lead to the invalidation of a committed transaction. D e) Non-recoverable schedules cannot take full advantage of CPU parallelism. Q.) Which following statements about the Boyce-Codd Normal Form (BCNF) and the Third Normal form (3NF) is true? (choose only one) O a) A 3NF decomposition is guaranteed to avoid all BCNF violations O b) In a 3NF decomposition all the functional dependencies can be enforced through key constraints O c) Every 3NF decomposition is also a valid Boyce-Codd decomposition O d) No decomposition can respect both the BCNF and the 3NF criterion at the same time O e) A BCNF decomposition may introduce spurious tuples into the database