Quiz Space

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

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

Question 13

+3 marksNumerical answer

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)?

Show answer

Correct answer: 21

See the whole paperTake it as a mock test

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 the instance of a relation R. Which among the following functional dependencies set can be inferred from the g…
  2. Q2Figure question
  3. Q3Consider the following monthly backup schedule used by a company: | Monday | Tuesday | Wednesday | Thursday | Friday | …
  4. Q4Consider the following schedule S.\ S:W1(A), W3(A), W3(C), R2(A), W2(A), W1(B), W3(B)\ Consider the following statement…
  5. Q5Consider a B+-tree index to be built on the attribute OrderID of a table Orders, with the following properties: The len…
  6. Q6Consider the following relational schema:\ Student(<u>student_id</u>, first_name, last_name, course_id)\ Course(<u>cour…
  7. Q7Consider the following statements and select the correct option.\ RAID 1 employs mirroring, maintaining two identical c…
  8. Q8Choose the correct statement(s).
  9. Q9Consider the hash functions given below. h_1(n) = (n) \bmod 6, h_2(n) = (n^2 + 2) \bmod 11, h_3(n) = (4n + 5) \bmod 25,…
  10. Q10Figure question
  11. Q11Consider the following Entity Relationship Diagram: Choose the correct statements.
  12. Q12Consider the Employee table given below: | EmpID | Name | Dept | Salary | |---|---|---|---| | 001 | Harry | IT | 80000 …
  13. Q14Consider a Block nested loop join for the two relations, employee and department. Assuming the worst-case memory availa…
  14. Q15Figure question
  15. Q16Figure question
  16. Q17Figure question
  17. Q18Consider the given log records at an instance of time: Table 3: Log records | < T_0 \text{ start} > | |---| | < T_0, A,…
  18. Q19Consider the SQL query to create a table Insurance and Nominee as shown below and answer the given subquestions The ins…
  19. Q20Consider the SQL query to create a table Insurance and Nominee as shown below and answer the given subquestions The ins…