GATE 2025 · CS2 - Afternoon
Consider the database transactions T1 and T2, and data items X and Y. T1: R1(X), W1(Y), R1(X), W1(X), COMMIT(T1). T2: W2(X), W2(Y), COMMIT(T2).
Which of the schedule(s) is/are conflict serializable?
Related Database Management PYQs
A schedule of three database transactions T1, T2, and T3 is shown. Ri(A) and Wi(A) denote read and write of data item A by transac…
Consider the 3-way handshaking protocol for TCP connection establishment. Let the three packets exchanged during the connection es…
Consider two relations describing teams and players in a sports league: - teams(tid,tname): tid, tname are team-id and team-name, …
Consider a relational schema team(name, city, owner), with functional dependencies {name → city, name → owner}. The relation team …
Consider the following database tables of a sports league. player(pid,pname,age) coach(cid,cname) team(tid,tname,city,cid) memb…
An audit of a banking transactions system has found that on an earlier occasion, two joint holders of account A attempted simultan…
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.