BTechibtechi.in
Loading Loading
Free IIT Madras BS notes, PYQs and mock tests at btechi.in

DBMS · Most repeated questions

92 questions · 242 marks · 7 papers · 34 question types

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Database Management Systems

Most repeated questions

Official Paper

Examination Instructions & Guidelines

Solve on notebook/paper first before checking solutions.
MCQ: Exactly 1 option is correct. Negative marking applies.
MSQ: One or more options correct. Select all to score.
NAT: Numerical response. No negative marking.
Scientific calculator allowed for all calculations.
Official answer key is sealed at the end of this sheet.

Type 1 · asked 5 times · Recovery, logs & backup

Count backup sets to load for full recovery from a backup schedule

Q1MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A5
2. B4
3. C3
4. D2
Q2MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A5
2. B4
3. C3
4. D6
Q3MCQ2 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A4
2. B5
3. C6
4. D3
Q4MCQ2 Marks·Choose one option
End Term · 13 Apr 2025 (FN)Key ↓
1. A4
2. B5
3. C6
4. D7
Q5NAT2 Marks·Write the number
End Term · 31 Aug 2025 (FN)Key ↓
Your answer:

Type 2 · asked 5 times · Functional dependencies & keys

Pick FDs that hold in a given relation instance

Q6MSQ2 Marks·Choose all correct options
End Term · 22 Dec 2024 (AN)Key ↓
Which of the following functional dependencies hold in the Students table?
1. A
2. B
3. C
4. D
Q7MSQ2 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q8MCQ2 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q9MSQ2 Marks·Choose all correct options
End Term · 13 Apr 2025 (FN)Key ↓
1. A
2. B
3. C
4. D
Q10MSQ2 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 3 · asked 5 times · Entity-relationship model

Read cardinality and participation statements from an ER diagram

Q11MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. AA bank offers more than one loan
2. BAn account is managed by more than one bank
3. CEvery loan must be availed by at least one customer
4. DEvery customer must be holding at least one account
Q12MSQ2 Marks·Choose all correct options
End Term · 13 Apr 2025 (AN)Key ↓
Consider the following Entity Relationship Diagram: Choose the correct statements.
1. AA bank can provide exactly one ATM machine
2. BAn ATM card can be used by multiple customers
3. CA customer can use multiple ATM cards
4. DAn ATM card can be inserted in many ATM machines
Q13MSQ2 Marks·Choose all correct options
End Term · 13 Apr 2025 (FN)Key ↓
Consider the following Entity Relationship Diagram: Choose the correct statements.
1. AA bank can provide more than one ATM machine
2. BAn ATM card is used by only one customer
3. CA customer can use only one ATM card
4. DAn ATM card can be inserted in many ATM machines
Q14MSQ2 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D
Q15MSQ3 Marks·Choose all correct options
Quiz 1 · 26 Oct 2025 (AN)Key ↓
1. AThere might exist an item that has not been produced by any company
2. BThere might exist a customer who has not ordered any item
3. CAn item can be ordered by multiple customers
4. DAn item cannot be produced by more than one company

Type 4 · asked 4 times · Recovery, logs & backup

Find values of data items on disk after a crash from given log records

Q16MCQ3 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q17MCQ3 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. AA = 1000, B = 750, C = 1700, D = 710
2. BA = 1000, B = 750, C = 1700, D = 690
3. CA = 1000, B = 350, C = 1700, D = 710
4. DA = 1000, B = 350, C = 1700, D = 690
Q18NAT3 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q19NAT3 Marks·Write the number
End Term · 13 Apr 2025 (FN)Key ↓
Your answer:

Type 5 · asked 4 times · Query processing & join cost

Find inner relation blocks from block nested-loop join cost

Q20NAT3 Marks·Write the number
End Term · 22 Dec 2024 (AN)Key ↓
Consider a Block nested loop join for the two relations, instructor and department. Assuming the worst-case memory availability and instructor as the outer relation, the provided details are as follows: What is the number of blocks in the inner relations?
Your answer:
Q21NAT3 Marks·Write the number
End Term · 22 Dec 2024 (FN)Key ↓
Consider a Block nested loop join for the two relations, instructor and department. Assuming the worst-case memory availability and instructor as the outer relation, the provided details are as follows: • Total number of block transfers: 25000 • Total number of seeks required: 500 • Number of block in the outer relation: 250 What is the number of blocks in the inner relation?
Your answer:
Q22NAT3 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q23NAT3 Marks·Write the number
End Term · 13 Apr 2025 (FN)Key ↓
Your answer:

Type 6 · asked 4 times · Normal forms & decomposition

Check lossless join, dependency preservation and NF of a decomposition

Q24MCQ3 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. AThe decomposition of R into R1 and R2 is dependency preserving.
2. BThe decomposition of R into R1 and R2 is lossless.
3. CThe schema R1 is in 3NF.
4. DThe schema R2 is in 2NF.
Q25MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. AThe decomposition of R into R1 and R2 is dependency preserving.
2. BThe decomposition of R into R1 and R2 is lossless.
3. CThe schema R1 is in 3NF.
4. DThe schema R2 is in 2NF.
Q26MCQ3 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
1. AThe decomposition is lossless and dependency preserving
2. BThe decomposition is lossy and dependency preserving
3. CThe decomposition is lossless but not dependency preserving
4. DThe decomposition is lossy and not dependency preserving
Q27MSQ3 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 7 · asked 4 times · Relational model & relational algebra

Pick RA/TRC/DRC expressions for an English query on a given schema

Q28MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q29MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q30MSQ2 Marks·Choose all correct options
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q31MSQ2 Marks·Choose all correct options
End Term · 13 Apr 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 8 · asked 3 times · Recovery, logs & backup

Decide undo/redo/ignore for transactions around a checkpoint and failure

Q32MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (AN)Key ↓
Consider a state of transactions as shown in Figure 3. Which of the following statement(s) is/are correct according to the given figure?
1. AT1 can be ignored and T3 needs to be redone.
2. BT4 and T5 need to be undone.
3. CT1 needs to be redone and T4 can be undone.
4. DT2 needs to be undone and T4 needs to be redone.
Q33MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. AT2 can be ignored and T3 needs to be redone.
2. BT4 needs to be undone and T5 needs to be redone.
3. CT1 needs to be redone and T4 can be undone.
4. DT3 needs to be undone and T4 needs to be redone.
Q34MSQ3 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. AT0 and T1 can be ignored.
2. BT0,T1, T2 and T3 can be ignored.
3. CT4 need to be undone.
4. DT0 and T3 need to be redone.

Type 9 · asked 3 times · Transactions & serializability

Check conflict serializability and 2PL-lockability of a schedule

Q35MCQ3 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
Consider the following schedule S. S:W1(A), W3(A), W3(C), R2(A), W2(A), W1(B), W3(B) Consider the following statements. Statement 1: The given schedule S is Conflict serializable. Statement 2: All Conflict serializable schedules are 2-P lockable. Statement 3: The given schedule is 2-P lockable. Which of the following options is correct?
1. AStatement 1 is true and statement 3 is false
2. BStatement 2 is true and statement 3 is false
3. CStatements 1 and 2 are true
4. DAll these statements are true.
Q36MSQ3 Marks·Choose all correct options
End Term · 13 Apr 2025 (FN)Key ↓
1. ASchedule S is conflict serializable.
2. BSchedule S can be two-phase lockable.
3. CTwo phase lockable schedule are always serializable schedule.
4. DSchedule S is not View Serializable
Q37MSQ3 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. ASchedule S can not be two-phase lockable.
2. BSchedule S can be two-phase lockable.
3. CSchedule S can be strict two-phase lockable.
4. DSchedule S is conflict serializable.

Type 10 · asked 3 times · Transactions & serializability

Count conflict-equivalent serial schedules of a given schedule

Q38NAT3 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q39NAT3 Marks·Write the number
End Term · 13 Apr 2025 (FN)Key ↓
Your answer:
Q40NAT3 Marks·Write the number
End Term · 31 Aug 2025 (FN)Key ↓
Your answer:

Type 11 · asked 3 times · Functional dependencies & keys

Count the super keys of a relation from its FD set

Q41NAT3 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q42NAT3 Marks·Write the number
End Term · 13 Apr 2025 (FN)Key ↓
Your answer:
Q43NAT4 Marks·Write the number
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Your answer:

Type 12 · asked 3 times · Relational model & relational algebra

Pick relational algebra expressions equivalent to a project-select-join

Q44MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q45MSQ2 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q46MSQ2 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 13 · asked 3 times · Storage: disks, RAID & buffers

Count page faults for a buffer replacement policy (LRU/MRU)

Q47NAT3 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q48NAT3 Marks·Write the number
End Term · 13 Apr 2025 (FN)Key ↓
Consider a system using the Least Recently Used (LRU) page replacement policy. The system has a main memory buffer with 4 slots, and the page reference sequence is as follows: 3, 4, 1, 4, 2, 3, 1, 4, 2, 3 Calculate the total number of page misses (page faults) during this sequence.
Your answer:
Q49MCQ4 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
1. A8
2. B9
3. C10
4. D11

Type 14 · asked 3 times · B+ trees, BSTs & multilevel index

Max and min number of keys in the root of a B+ tree of order n

Q50MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
Consider a non-empty B+-tree of order 16. What are the maximum and minimum number of keys that can be placed in the root node?
1. Amax. number of keys = 15, min. number of keys = 8.
2. Bmax. number of keys = 15, min. number of keys = 1.
3. Cmax. number of keys = 16, min. number of keys = 1.
4. Dmax. number of keys = 16, min. number of keys = 8.
Q51MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
Consider a non-empty B+-tree of order 13. What are the maximum and minimum number of keys that can be placed in the root node?
1. Amax. number of keys = 13, min. number of keys = 6.
2. Bmax. number of keys = 12, min. number of keys = 1.
3. Cmax. number of keys = 14, min. number of keys = 1.
4. Dmax. number of keys = 14, min. number of keys = 7.
Q52MCQ2 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
Consider a non-empty B+-tree of order 17. What are the maximum and minimum number of keys that can be placed in the root node?
1. Amax. number of keys = 16, min. number of keys = 1.
2. Bmax. number of keys = 17, min. number of keys = 1.
3. Cmax. number of keys = 16, min. number of keys = 8.
4. Dmax. number of keys = 17, min. number of keys = 8.

Type 15 · asked 2 times · Transactions & serializability

Check conflict and view serializability of a schedule

Q53MCQ3 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. AA precedence graph of the schedule is cyclic
2. BThe given schedule is not view serializable
3. CThe given schedule is view serializable but not conflict serializable
4. DThe given schedule is view serializable and conflict serializable
Q54MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. AA precedence graph of the schedule is acyclic
2. BThe given schedule is not view serializable
3. CThe given schedule is view serializable but not conflict serializable
4. DThe given schedule is view serializable and conflict serializable

Type 16 · asked 2 times · Transactions & serializability

Check if two schedules S1 and S2 are conflict/view equivalent

Q55MCQ3 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. AStatements 1 and 4 are correct.
2. BStatements 1 and 3 are correct.
3. CStatements 2 and 3 are correct.
4. DStatements 2 and 4 are correct.
Q56MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. AS1 and S2 are conflict equivalent.
2. BS1 and S2 are not conflict equivalent.
3. CS1 and S2 are view equivalent.
4. DS1 and S2 are not view equivalent.

Type 17 · asked 2 times · Normal forms & decomposition

Find tuples that must exist given a multivalued dependency

Q57MCQ4 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
1. AF = Novel, G = BookWorld, H = ReadersHub, I = Delhi, J = Mumbai
2. BF = Magazine, G = BookWorld, H = ReadersHub, I = Delhi, J = Mumbai
3. CF = Magazine, G = ReadersHub, H = BookWorld, I = Delhi, J = Mumbai
4. DF = Novel, G = ReadersHub, H = BookWorld, I = Mumbai, J = Delhi
Q58MSQ3 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A(0,1,2,7,8)
2. B(0,5,2,3,4)
3. C(0,5,6,3,8)
4. D(0,5,2,7,4)

Type 18 · asked 2 times · Relational model & relational algebra

Pick RA expressions for IT employees earning above 70,000

Q59MSQ2 Marks·Choose all correct options
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q60MSQ2 Marks·Choose all correct options
End Term · 13 Apr 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 19 · asked 2 times · SQL queries & their output

Find students who took no course from a given department in SQL

Q61MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. AID and name of students who have not taken any course from Biology department
2. BID and name of students who have taken courses from Biology department
3. CID and name of students who have taken all the courses from Biology department
4. DID and name of students who have not taken courses from other than Biology department
Q62MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 20 · asked 2 times · SQL queries & their output

Choose SQL with GROUP BY/HAVING to find categories by product price

Q63MCQ2 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q64MCQ2 Marks·Choose one option
End Term · 13 Apr 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 21 · asked 2 times · SQL queries & their output

Match SQL queries (LIKE, GROUP BY, JOIN) to English questions

Q65MCQ3 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A1-a, 2-d, 3-f
2. B1-b, 2-d, 3-e
3. C1-a, 2-c, 3-e
4. D1-b, 2-c, 3-f
Q66MCQ3 Marks·Choose one option
End Term · 13 Apr 2025 (FN)Key ↓
1. A1-a, 2-c, 3-f
2. B1-b, 2-c, 3-e
3. C1-a, 2-d, 3-e
4. D1-b, 2-d, 3-f

Type 22 · asked 2 times · SQL DDL, constraints & app development

Find the INSERT that violates CREATE TABLE constraints

Q67MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q68MSQ3 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 23 · asked 2 times · SQL DDL, constraints & app development

Count rows in insurance and nominee tables after a DELETE

Read the passage below, then answer Q69
Q69NAT3 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Read the passage below, then answer Q70
Q70NAT3 Marks·Write the number
End Term · 13 Apr 2025 (FN)Key ↓
Your answer:

Type 24 · asked 2 times · SQL DDL, constraints & app development

Find nominee table contents after INSERTs with foreign keys

Read the passage below, then answer Q71
Q71MCQ3 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Read the passage below, then answer Q72
Q72MCQ3 Marks·Choose one option
End Term · 13 Apr 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 25 · asked 2 times · Hashing & bitmap indices

Find the column a bitmap index is built on

Q73MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. Ateam
2. Brating
3. Cage
4. Dtype
Q74MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. Ateam
2. Brating
3. Cage
4. Dtype

Type 26 · asked 2 times · Storage: disks, RAID & buffers

Compute storage efficiency of RAID-1 and RAID-4

Q75MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q76MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 27 · asked 2 times · Storage: disks, RAID & buffers

Compute disk transfer rate from RPM, sectors and sector size

Q77MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
Consider seek time of your hard disk read head is 2ms, rotational speed is 30,000 RPM. The disk has 400 sectors/track and sector size is 128 bytes. What will be the transfer rate (KB/ms)?
1. A75 KB/ms
2. B25 KB/ms
3. C50 KB/ms
4. D100 KB/ms
Q78MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
Consider seek time of your hard disk read head is 2ms, rotational speed is 60,000 RPM. The disk has 300 sectors/track and sector size is 256 bytes. What will be the transfer rate (KB/ms)?
1. A75 KB/ms
2. B25 KB/ms
3. C50 KB/ms
4. D100 KB/ms

Type 28 · asked 2 times · Storage: disks, RAID & buffers

Time to read a file stored in non-consecutive disk sectors

Q79NAT3 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Consider you have a file in your hard disk of size 1024 KB. The seek time of your hard disk read head is 4 ms, and the rotational speed is 30,000 rpm. The disk has 256 sectors per track, and each sector stores 512 bytes. Considering that the file data is stored in non-consecutive sectors, how much time will be required to read the whole file after a read request is made (in ms)?
Your answer:
Q80NAT3 Marks·Write the number
End Term · 13 Apr 2025 (FN)Key ↓
Consider you have a file in your hard disk of size 1000 KB. Seek time of your hard disk read head is 3ms and rotational speed in 30,000 rpm. The disk has 200 sectors per track and 512 bytes per sector. Considering the fact that the file data is stored in non consecutive sectors. How much time will be required to read the whole file after a read request is made? (in ms)
Your answer:

Type 29 · asked 2 times · B+ trees, BSTs & multilevel index

Count node splits when inserting keys into a B+ tree of order 3

Q81MCQ3 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A5
2. B4
3. C6
4. D3
Q82MCQ3 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A5
2. B4
3. C6
4. D3

Type 30 · asked 2 times · B+ trees, BSTs & multilevel index

Number of blocks at each level of a multilevel index

Q83MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
Consider a multilevel index with five levels as L1, L2, L3, L4 and L5. Let L1 be the innermost and L5 be the outermost levels. Let the index blocking factor or the maximum number of entries held by a block be 25. If the number of blocks in level L1 is 12,50,000, then how many blocks are required at L2, L3, L4 and L5?
1. ANumber of blocks at L2 is 50000, Number of blocks at L3 is 2000, Number of blocks at L4 is 80, Number of blocks at L5 is 4
2. BNumber of blocks at L2 is 125000, Number of blocks at L3 is 2000, Number of blocks at L4 is 80, Number of blocks at L5 is 1
3. CNumber of blocks at L2 is 50000, Number of blocks at L3 is 2000, Number of blocks at L4 is 80, Number of blocks at L5 is 1
4. DNumber of blocks at L2 is 125000, Number of blocks at L3 is 2500, Number of blocks at L4 is 80, Number of blocks at L5 is 4
Q84MCQ2 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
Consider a multilevel index with five levels as L1, L2, L3, L4 and L5. Let L1 be the innermost and L5 be the outermost levels. Let the index blocking factor or the maximum number of entries held by a block be 50. If the number of blocks in level L1 is 62,50,000, then how many blocks are required at L2, L3, L4 and L5?
1. ANumber of blocks at L2 is 125000, Number of blocks at L3 is 2500, Number of blocks at L4 is 50, Number of blocks at L5 is 1
2. BNumber of blocks at L2 is 125000, Number of blocks at L3 is 2000, Number of blocks at L4 is 50, Number of blocks at L5 is 1
3. CNumber of blocks at L2 is 120000, Number of blocks at L3 is 2400, Number of blocks at L4 is 40, Number of blocks at L5 is 1
4. DNumber of blocks at L2 is 120000, Number of blocks at L3 is 3000, Number of blocks at L4 is 60, Number of blocks at L5 is 1

Type 31 · asked 2 times · B+ trees, BSTs & multilevel index

Best B+ tree order from key size, pointer size and block size

Q85MCQ3 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A19
2. B20
3. C21
4. D22
Q86MCQ2 Marks·Choose one option
End Term · 13 Apr 2025 (FN)Key ↓
1. A19
2. B20
3. C21
4. D22

Type 32 · asked 2 times · Hashing & bitmap indices

Statements on static vs dynamic hashing

Q87MSQ1 Mark·Choose all correct options
End Term · 13 Apr 2025 (AN)Key ↓
Choose the correct statement(s).
1. AIn static hashing, overflow is commonly handled using overflow buckets or chaining.
2. BDynamic hashing is suitable for applications where the number of records is unpredictable.
3. CStatic hashing is ideal when the dataset size is expected to grow significantly.
4. DDynamic hashing ensures that hash table utilization remains balanced as data changes.
Q88MSQ1 Mark·Choose all correct options
End Term · 13 Apr 2025 (FN)Key ↓
Choose the correct statement(s).
1. AIn static hashing, the size of the hash table remains fixed, which may lead to overflow or underutilization of space.
2. BIn dynamic hashing, the hash table grows and shrinks dynamically as data is inserted or deleted.
3. CStatic hashing is more efficient for applications where the number of records is expected to change frequently.
4. DDynamic hashing does not handle collisions effectively compared to static hashing.

Type 33 · asked 2 times · Hashing & bitmap indices

Pick hash functions that give unique values for given keys

Q89MSQ3 Marks·Choose all correct options
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q90MCQ3 Marks·Choose one option
End Term · 13 Apr 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 34 · asked 2 times · B+ trees, BSTs & multilevel index

Build a BST from an insert order and answer questions about it

Q91MSQ4 Marks·Choose all correct options
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Construct a binary search tree by inserting the values in the following order 15,14, 30, 5, 13, 19, 26, 12, 1, 6. Which of the following statement(s) is/are correct? Note: Consider the root node at level 0.
1. AThe height of binary search tree is 6.
2. BThe sum of the leaf nodes of the binary search tree is 33
3. CThe nodes 12,1 and 6 are part of the left subtree of node 13.
4. DNode 19 is at level 2
Q92MCQ3 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
1. A2
2. B0
3. C1
4. D5

Official Key

Master Answer Key & Explanations

Official answer keys from IIT Madras BS past papers. Click any question to review.

Reveal Key

Q1D

Q2C

Q3D

Q4C

Q54

Q6A, B

Q7A, C, D

Q8D

Q9D

Q10D

Q11A, D

Q12C, D

Q13A, B, D

Q14A, B, D

Q15C, D

Q16A

Q17A

Q182200

Q19500

Q2059

Q21100

Q2239

Q2341

Q24B

Q25A, C, D

Q26C

Q27A, B, C

Q28C, D

Q29B, C

Q30A, B

Q31A, B

Q32B, C

Q33A, C

Q34A, C

Q35A

Q36A, B, C

Q37A, C

Q384

Q395

Q408

Q4124

Q4224

Q4312

Q44A, C

Q45B, D

Q46A, D

Q474

Q484

Q49C

Q50B

Q51B

Q52A

Q53D

Q54A, D

Q55C

Q56A, C

Q57B

Q58B, C, D

Q59B, C

Q60A, D

Q61A

Q62C, D

Q63D

Q64A

Q65A

Q66D

Q67A, B

Q68A, B

Q696

Q704

Q71B

Q72C

Q73B

Q74D

Q75A

Q76A

Q77B

Q78A

Q7921

Q8024

Q81A

Q82A

Q83A

Q84A

Q85B

Q86B

Q87A, B, D

Q88A, B

Q89C, D

Q90C

Q91B, D

Q92C

Questions and answer keys are reproduced from the official IIT Madras BS papers. Topics and repeated question types are BTechi’s own grouping. BTechi is not affiliated with IIT Madras.