Discussion
Precedence graphs help to find a
Answer: A
Correct answer: Serializable schedule.
A precedence, or serialization, graph has a node per transaction and an edge for each conflicting pair. If the graph has no cycle the schedule is serializable; a cycle means it is not. Deadlock is detected with a different graph, the wait-for graph.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development