GATE 2010
In a B-tree of order m, the root node must contain at least how many keys (if it is not a leaf node)?
Related Database Management PYQs
In an Entity-Relationship (ER) diagram, a weak entity set is represented by a:
Two actions in a transaction schedule are said to be in conflict if and only if:
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.