Deadlocks DBMS Questions And Answers

Here you can find Deadlocks DBMS Questions and Answers.

Why Deadlocks DBMS Questions and Answers Required?

In this Deadlocks DBMS Questions and Answers section you can learn and practice Deadlocks DBMS Questions and Answers to improve your skills in order to face technical inerview conducted by organisations. By Practicing these interview questions, you can easily crack any Exams interview.

Where can I get Deadlocks DBMS Questions and Answers?

AllIndiaExams provides you lots Deadlocks DBMS Questions and Answers with proper explanation. Fully solved examples with detailed answer description. All students, freshers can download Deadlocks DBMS Questions and Answers as PDF files and eBooks.

How to solve these Deadlocks DBMS Questions and Answers?

You no need to worry, we have given lots of Deadlocks DBMS Questions and Answers and also we have provided lots of FAQ's to quickly answer the questions in the Competitive Exams interview.

Deadlocks DBMS Questions and Answers

1. A system is in a ______ state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set.

Deadlocks DBMS Questions and Answers

2. The deadlock state can be changed back to stable state by using _____________ statement.

Deadlocks DBMS Questions and Answers

3. What are the ways of dealing with deadlock ?

Deadlocks DBMS Questions and Answers

4. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled back (dies). This is

Deadlocks DBMS Questions and Answers

5. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti ). This is

Deadlocks DBMS Questions and Answers

6. The deadlock in a set of transaction can be determined by

Deadlocks DBMS Questions and Answers

7. A deadlock exists in the system if and only if the wait-for graph contains a ___________.

Deadlocks DBMS Questions and Answers

8. Selecting the victim to be rollbacked to the previous state is determined by the minimum cost. The factors determining cost of rollback is

Deadlocks DBMS Questions and Answers

9. __________ rollback requires the system to maintain additional information about the state of all the running transactions.

Deadlocks DBMS Questions and Answers

10. Which of these is data type long literal?

Deadlocks - DBMS Questions and Answers

This is the DBMS questions and answers section on "Deadlocks" with explanation for various interview, competitive examination and entrance test. Solved examples with detailed answer description, explanation are given and it would be easy to understand.

Deadlocks DBMS Questions

Online Test Name	Deadlocks
Exam Type	Multiple Choice Questions
Category	Computer Science Engineering Quiz
Number of Questions	14

1. A system is in a ______ state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set.

A. Idle
B. Waiting
C. Deadlock
D. Ready

Answer & Explanation

Answer: Option C

Explanation:

Deadlock

When one data item is waiting for another data item in a transaction then system is in deadlock.

Workspace

Report Error

2. The deadlock state can be changed back to stable state by using _____________ statement.

A. Commit
B. Rollback
C. Savepoint
D. Deadlock

Answer & Explanation

Answer: Option B

Explanation:

Rollback

Rollback is used to rollback to the point before lock is obtained.

Workspace

Report Error

3. What are the ways of dealing with deadlock ?

A. Deadlock prevention
B. Deadlock recovery
C. Deadlock detection
D. All of the mentioned

Answer & Explanation

Answer: Option D

Explanation:

All of the mentioned

Deadlock prevention is also called as deadlock recovery.Prevention is commonly used if the probability that the system would enter a deadlock state is relatively high; otherwise, detection and recovery are more efficient.