GATE 2004
A schedule in which the operations of conflicting transactions are ordered in the same sequence as some serial execution of those transactions is called:
Related Database Management PYQs
Consider relation R(A, B, C) with functional dependencies F = {A -> B, B -> C}. If R is decomposed into R1(A, B) and R2(A, C), whi…
Under the basic Timestamp Ordering protocol, if a transaction Ti issues a read(Q) operation and TS(Ti) < W-timestamp(Q), the syste…
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 …
In the context of relational database normalization, which of the following statements is/are true?
Consider a relational database schema with two relations R(P,Q) and S(X,Y). Let E = {<u> | there ∃ v, there ∃ w, <u,v> in R and <v…
Consider a relational database schema with a relation R(A,B,C,D). If {A,B} and {A,C} are the only two candidate keys of the relati…
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.