Consider a B+ tree index to be built on the attribute EmployeeID of a table Employees, with the following properties: • The length of the attribute EmployeeID is 16 bytes. • The size of each child pointer is 8 bytes. • The size of each disk block size is 512 bytes. • The size of each record pointer is 10 bytes. With the given information, what is the best choice for the order of the non-leaf nodes of the B+ tree?
19
20
21
22
4
5
6
7
{A → D, C → D, AB → C, D → A}
{C → D, AD → B, AB → D, D → C}
{A → B, C → D, AB → C, D → B}
{C → D, AB → D, B → A, A → D }
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
The IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 10 May 2026, in the January 2026 term, set 2: 20 questions for 50 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | DBMS End Term 10 May 2026 Set 2 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | Database Management Systems |
| Course code | BSCS2001 |
| Questions | 20 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 8 |
| MSQ | 7 |
| Written | 5 |
| Official paper | Database Management Systems 06 May 26 |
| Negative marking | No negative marking. |
| Updated |
