GATE 2015 · Set-2
In a B+ tree of order d (maximum number of pointers per internal node is d), the minimum number of keys in any non-root internal node is
Related Database Management PYQs
SQL allows duplicates tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which on…
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary); departments(dept-id,dept-name,ma…
A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Th…
SELECT operation in SQL is equivalent to
Consider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected by an m:n relationship R12. E1 and E3 are …
See the question below and answer
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.