GATE 2017 · CS2 - Afternoon
In a B+ tree, if the search-key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then the maximum order of the B+ tree is _______
Related Database Management PYQs
An ER model of a database consists of entity types A and B. These are connected by a relationship R which does not have its own at…
Consider tables T1(P, Q) and T2(R, S). In table T1, P is primary key and Q is foreign key referencing R in T2 with on-delete casca…
Two transactions T1 and T2 are given as: T1: r1(X) w1(X) r1(Y) w1(Y) T2: r2(Y) w2(Y) r2(Z) w2(Z) The total number of conflict seri…
Consider table top_scorer(player, country, goals). Query: SELECT ta.player FROM top_scorer AS ta WHERE ta.goals >ALL (SELECT tb.go…
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?
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.