DS0-001 · Question #95
DS0-001 Question #95: Real Exam Question with Answer & Explanation
The correct answer is A: Read. A shared lock (also called a read lock) permits multiple transactions to read the same data simultaneously, which is why option A is correct - shared locks exist precisely to allow concurrent reads without interference. Options B (Update), C (Delete), and D (Insert) all require a
Question
Which of the following transactions is allowed in a shared lock?
Options
- ARead
- BUpdate
- CDelete
- DInsert
Explanation
A shared lock (also called a read lock) permits multiple transactions to read the same data simultaneously, which is why option A is correct - shared locks exist precisely to allow concurrent reads without interference. Options B (Update), C (Delete), and D (Insert) all require an exclusive lock, which blocks other transactions entirely, because these write operations modify data and could cause inconsistency if allowed alongside concurrent reads or other writes. The key distinction is that shared locks are non-destructive - they only observe data, never change it, so sharing access is safe.
Memory tip: Think of a shared lock like a library reading room - many people can read the same book at once (shared/read), but nobody can write in, tear out pages, or add new pages (update/delete/insert) while others are reading it.
Community Discussion
No community discussion yet for this question.