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 record pointer is 8 bytes. • The size of each disk block is 488 bytes. With the given information, what is the best choice for the order of the non-leaf nodes of the B-tree?
14
15
16
17
Consider the table BandRecords as given below:
Let us create two different bitmap indices, one on the Tour attribute and the other on the Genre attribute. Which of the following options will give the correct result if we want to find all bands performing in 'RetroLive' and having the genre 'Rock'? Note: Options are in the form of Tour (operation) Genre
10000100 AND 00100100
00000101 OR 11001001
00001001 AND 11001001
00001001 OR 00100100
Consider the relational schemas Student, Course and Enrolled:
Now consider the following SQL query:
The query returns:
Names of students who failed in all courses
Names of students who failed in at least one course
Names of students who have not failed in any course
Names of students who are enrolled in all courses
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 1: 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 1 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | Database Management Systems |
| Course code | BSCS2001 |
| Questions | 20 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 8 |
| MSQ | 6 |
| Written | 6 |
| Official paper | Database Management Systems 06 May 26 |
| Negative marking | No negative marking. |
| Updated |
