1. True or False: User interaction is usually avoided during a database transaction because the user may take an unpredictably long time to complete their actions.
2. Which term(s) below describe this schedule and its dependency graph:

1. Serializable
2. Non-serializable
3. Acyclic
4. Both a. and c.

3. Which statement below accurately describes this schedule:

T1	T2	T3	T4
Read(A)
Read(B)
Write(A)
	Read(A)
	Write(A)
		Read(A)
		Read(B)
			Read(B)
Abort

1. All transactions in the schedule will need to be rolled back
2. Transactions T1, T2 and T3 will need to be rolled back but T4 will not need to be rolled back
3. Transactions T1 and T2 will need to be rolled back but T3 and T4 will not need to be rolled back
4. The schedule is noncascading (only the aborted T1 transaction needs to be rolled back)

4. Match the following terms with their best description:

Term	Matching Description	Descriptions
Read Committed		Transactions are guaranteed to be serializable Only committed records to be read, repeated reads of same record must return same value. Only committed records can be read, but successive reads of record may return different values Uncommitted records may be read
Read Uncommitted
Repeatable Read
Serializable