MC	A schedule in 2PL is deadlock free if...	both the local and global wait-for graphs contain no cycles.	correct	the local wait-for graph contains only a limited number of cycles.	incorrect	the global wait-for graph contains only a limited number of cycles.	incorrect	the local wait-for graphs contain no cycles.	incorrect	
MC	Many NoSQL databases apply some form of...	vertical fragmentation.	incorrect	horizontal fragmentation.	correct	
MC	A schedule in 2PL is deadlock free if...	both the local and global wait-for graphs contain no cycles.	correct	the local wait-for graph contains only a limited number of cycles.	incorrect	the local wait-for graphs contain no cycles.	incorrect	the global wait-for graph contains only a limited number of cycles.	incorrect	
MC	Many NoSQL databases apply some form of...	horizontal fragmentation.	correct	vertical fragmentation.	incorrect	
MC	Which statement is CORRECT?	In a shared memory architecture, multiple interconnected processors that run the DBMS software share the same central storage and secondary storage. 	incorrect	With a shared disk architecture, each processor has its own central storage but shares secondary storage with the other processors. 	incorrect	In a shared nothing architecture, each processor has its own central storage and hard disk units.	incorrect	All statements are CORRECT.	correct	
MC	Optimistic concurrency may considerably increase transaction throughput and overall data availability in a...	loosely coupled setting.	correct	tightly coupled setting.	incorrect	
MC	With horizontal fragmentation...	each fragment consists of a subset of the columns of the global data set.	incorrect	each fragment consists of rows that satisfy a certain query predicate.	correct	
MC	Eventual consistency in a NoSQL environment implies that...	the database is inconsistent at all times.	incorrect	the database is consistent at all times.	incorrect	the results of a database transaction will eventually be propagated to all replicas and if no further transactions are executed then the system will eventually become consistent.	correct	the results of a database transaction will immediately be propagated to all replicas.	incorrect	
MC	With BASE transactions, conflict resolution...	may be postponed until the data is actually read.	correct	always happens at the moment of writing the data.	incorrect	
MC	Optimistic concurrency may considerably increase transaction throughput and overall data availability in a...	tightly coupled setting.	incorrect	loosely coupled setting.	correct