What is a dead lock?
Submitted by: AdministratorWhen two computer programs sharing the same resource prevent each other from accessing the resource results in a deadlock. This deadlock results in finishing the program.
Example:
P1 requests R1 and receives it.
P2 requests R2 and receives it.
P1 requests resource R2 and is queued up, pending the release of R2.
P2 requests resource R1 and is queued up, pending the release of R1
Here, P and R is Program and Resource respectively.
Submitted by: Administrator
Example:
P1 requests R1 and receives it.
P2 requests R2 and receives it.
P1 requests resource R2 and is queued up, pending the release of R2.
P2 requests resource R1 and is queued up, pending the release of R1
Here, P and R is Program and Resource respectively.
Submitted by: Administrator
Read Online SQL Server Locks Job Interview Questions And Answers
Top SQL Server Locks Questions
| ☺ | What is a live lock? |
| ☺ | Do you know what guidelines should be followed to help minimize deadlocks? |
| ☺ | What is a dead lock? |
| ☺ | Explain what is lock escalation and what is its purpose? |
| ☺ | Explain optimistic and pessimistic concurrency? |
Top New MS SQL Server Categories
| ☺ | SQL Server Database Administrator Interview Questions. |
| ☺ | SQL Server Service Broker Interview Questions. |
| ☺ | SQL Server Locks Interview Questions. |
| ☺ | SQL Server Constraints Interview Questions. |
| ☺ | MS SQL Data Mining Interview Questions. |
