Quiz Space

Database Management Systems · End Term · 13 Apr 2025 · January 2025 term · Set QDD1

Question 13: Consider you have a file in your hard disk of size 1000 …

Question 13

+3 marksNumerical answer

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)

Show answer

Correct answer: 24

Question 13 of 20 in the IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 13 Apr 2025, in the January 2025 term (IIT M DIPLOMA AN EXAM QDD3 13 Apr 2025). It carries 3 marks.

More questions from this paper

  1. Q1Consider a B+-tree index to be built on the attribute StudentID of a table Students, with the following properties: The…
  2. Q2Consider a log of a transaction as shown below, where the immediate database modification scheme is used. | step | log …
  3. Q3Consider the following monthly backup schedule used by a company: | Monday | Tuesday | Wednesday | Thursday | Friday | …
  4. Q4Figure question
  5. Q5Figure question
  6. Q6Consider the following relational schema:\ Employee(<u>emp_id</u>, first_name, last_name, dept_id)\ Department(<u>dept_…
  7. Q7Choose the correct statement(s).
  8. Q8Consider the instance of a relation R. Which among the following functional dependencies set(s) can be inferred from th…
  9. Q9Consider the Employee table given below: | EmpID | Name | Dept | Salary | |---|---|---|---| | 001 | Harry | IT | 80000 …
  10. Q10Figure question
  11. Q11Consider the following Entity Relationship Diagram: Choose the correct statements.
  12. Q12Figure question
  13. Q14Consider a system using the Least Recently Used (LRU) page replacement policy. The system has a main memory buffer with…
  14. Q15Consider the given log records at an instance of time: Table 5: Log records | < T_0 \text{ start} > | |---| | < T_0, A,…
  15. Q16Figure question
  16. Q17Figure question
  17. Q18Consider a Block nested loop join for the two relations, instructor and department. Assuming the worst-case memory avai…
  18. Q19The instance of the table insurance and nominee is as shown below: | ins_id | policyHolderName | age | premium | |---|-…
  19. Q20The instance of the table insurance and nominee is as shown below: | ins_id | policyHolderName | age | premium | |---|-…