GATE 1993
Related Database Management PYQs
Consider relation R(A, B, C, D) with functional dependencies F = {A -> B, B -> C, C -> D}. What is the closure of attribute A (A+)…
If a relation schema is in 3NF and every candidate key is a single attribute (simple candidate key), then the relation is guarante…
A schedule S is defined as a view serializable schedule if:
Two operations in a schedule are said to conflict if they belong to different transactions, access the exact same data item, and:
Cascading rollback occurs in a schedule when:
Let P, Q, R and S be the attributes of a relation in a relational schema. Let X → Y indicate functional dependency in the context …
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.