Consider a magnetic disk with 4 platters, 2 surfaces per platter, 1024 tracks per surface, and 2048
sectors per track, with a disk capacity of 8 GB. Find the capacity of one sector.
A.
2048 bytes per sector
B.
1024 bytes per sector
C.
512 bytes per sector
D.
256 bytes per sector
A published solution is not available for this question yet.
The G20 is a global forum that brings together the world’s major economies to discuss and
cooperate on international economic and financial issues. The organizers of the G20 event have
designed a database to store information about the participants, their countries, and the issues
discussed.
The original database is
**G20Participants** (Participant_ID, Participant_Name, Participant_Email,
Participant_Country,Country_Leader_Name,Country_GDP, Issue_Discussed)
The functional dependencies are:
F = {Participant_ID → Participant_Name, Participant_Email
Participant_Country → Country_Leader_Name,Country_GDP
Participant_ID → Participant_Country}
The initial design of the database is as follows:
Table 1:
**Participants** (Participant_ID, Participant_Name, Participant_Email)
Table 2:
**Country** (Participant_Country,Country_Leader_Name,Country_GDP, Issue_Discussed)
The database designers have identified that this design violates the third normal form (3NF) of
database normalization.
Which of the following changes would bring the database design into 3NF?
A.
Split the **Country** table into two tables, one for the issue discussed and merge
with **Participants**.
B.
Remove Issue_Discussed and add Participant_ID in **Country** table. And create a
new table for the issues discussed and link it to the **Participants**.
C.
Remove Issue_Discussed from **Country** and create a new table for the issues
discussed and link it to the **Participants** tables using a foreign key.
D.
Remove Issue_Discussed from **Country** and create a new table for the issues
discussed and link it to the **Participants** and **Country** tables using a foreign key.
A published solution is not available for this question yet.
Consider a string of pending block references in the order given: 4, 6, 4, 1, 3, 2, 4, 1, 4, 2. The
system has a buffer with 4 slots. Assume that initially, the buffer is empty. If LRU buffer
replacement policy is used, then what will be the value of the following expression?
Number of misses − Number of hits
A published solution is not available for this question yet.
Consider a binary search tree consisting of 15 elements. Let m be the maximum height possible
for a given binary search tree, and n be the minimum height possible for a given binary search
tree.
What will be the value of m − n ?
A published solution is not available for this question yet.