Free Test Deadlock Handling – Databas...

Q1: What is a deadlock in database systems?

A. A situation where two or more transactions wait indefinitely for resources held by each other B. A transaction failure C. Database backup failure D. A slow query

Q2: Which condition is necessary for a deadlock to occur?

A. Circular wait B. Data redundancy C. Fast commit D. High memory usage

Q3: Which of the following is NOT a necessary condition for deadlock?

A. Preemption of resources B. Mutual exclusion C. Hold and wait D. Circular wait

Q4: What is the “mutual exclusion” condition?

A. Only one transaction can use a resource at a time B. Transactions can share resources C. Multiple backups run simultaneously D. Queries are executed concurrently

Q5: What is “hold and wait” condition?

A. Transactions holding resources can request more without releasing held ones B. All resources are free C. Transactions never request resources D. Resources are preempted

Q6: How can deadlocks be prevented?

A. By negating one of the necessary conditions like disabling hold and wait B. By increasing CPU speed C. By backing up data D. By using indexes

Q7: What is deadlock detection?

A. Identifying deadlocks during runtime and resolving them B. Preventing deadlocks completely C. Ignoring deadlocks D. Backup scheduling

Q8: How is a deadlock resolved once detected?

A. By aborting one or more transactions to break the cycle B. By restarting the database C. By increasing memory D. By running backup

Q9: What is a wait-for graph?

A. A graph used to detect deadlocks by representing waiting transactions B. A graph showing database schema C. A transaction log D. A backup plan

Q10: What does a cycle in a wait-for graph indicate?

A. Deadlock B. Fast transaction C. Backup success D. Data corruption

Q11: Which method is used to prevent circular wait?

A. Imposing an ordering of resource acquisition B. Increasing transaction speed C. Backing up data D. Using indexes

Q12: What is preemption in deadlock handling?

A. Taking a resource away from a transaction to break deadlock B. Waiting indefinitely C. Backing up data D. Locking a resource

Q13: Which transaction is usually aborted to resolve deadlock?

A. The one that is easiest to roll back or has done least work B. The oldest transaction C. The largest transaction D. The newest transaction

Q14: What is starvation in the context of deadlocks?

A. Some transactions never get resources because others are repeatedly favored B. A successful commit C. A deadlock resolution D. Backup process

Q15: How can starvation be prevented?

A. By using fair scheduling or priority adjustment B. By increasing CPU speed C. By deleting data D. By ignoring locks

Q16: What is the difference between deadlock prevention and deadlock avoidance?

A. Prevention negates conditions before they happen, avoidance uses dynamic checks B. They are the same C. Prevention is post-deadlock action D. Avoidance is backup

Q17: Which deadlock handling method is most commonly used in practice?

A. Detection and recovery B. Complete prevention C. Avoidance D. Ignoring deadlocks

Q18: What is a common way to implement deadlock detection?

A. Periodically running algorithms to check wait-for graph for cycles B. Using backups C. Increasing transaction speed D. Lock escalation

Q19: What is the role of a timeout in deadlock handling?

A. Aborting transactions that wait too long to break deadlocks B. Backing up data C. Speeding up queries D. Locking resources

Quiz for Deadlock Handling