Consider a disk with block size B = 512 bytes. A block pointer is P =...

Consider a disk with block size B = 512 bytes. A block pointer is P = 6 bytes long, and a record pointer is PR = 7 bytes long. A file has r = 30,000 EMPLOYEE records of fixed length. Each record has the following fields: Name (30 bytes),Ssn (9 bytes), Department_code (9 bytes), Address (40 bytes), Phone (10 bytes), Birth_date (8 bytes), Sex (1 byte), Job_code (4 bytes), and Salary (4 bytes, real number). An additional byte is used as a deletion marker.

Suppose that the file is not ordered by the key field Ssn and we want to construct a B+-tree access structure (index) on Ssn. Calculate (i) the orders p and pleaf of the B+-tree; (ii) the number of leaf-level blocks needed if blocks are approximately 69% full (rounded up for convenience); (iii) the number of levels needed if internal nodes are also 69% full (rounded up for convenience); (iv) the total number of blocks required by the B+-tree; and (v) the number of block accesses needed to search for and retrieve a record from the file—given its Ssn value—using the B+-tree.

Expert Solution

venereology answered 1 year ago

Assume a computer with a cache that holds 64 bytes and has a block size of...

Assume a computer with a cache that holds 64 bytes and has a block size of 32 bytes. Direct address mapping is used and from the beginning the cache is empty. The following program sequence is executed: for (col = 0; col < 2; col++) { for (row = 0; row < 4; row++) A[row][col] = B[row] * C[col]; } Assume that for the variables row and col registers are used. The matrix A consists of 4 rows and 4...

Ethernet (10Mbps) frames must be at least 64 bytes (512 bits) long to ensure that the...

Ethernet (10Mbps) frames must be at least 64 bytes (512 bits) long to ensure that the transmitter is still going in the event of a collision at the far end of the cable. Fast Ethernet (100Mbps) has the same 64-byte minimum frame size but can get the bits out ten times faster. How is it possible to maintain the same minimum frame size?

The equilibrium price and quantity are * A) P=620$ and Q=800 B) P=144$ and Q=512 C)...

The equilibrium price and quantity are * A) P=620$ and Q=800 B) P=144$ and Q=512 C) P=512$ and Q=144 D) P=220$ and Q=200 Which of the following is the Demand Equation * A) P=800+2Q B) P=800-2Q C) P=80-3Q D) P=80+3Q What is the self-regulation process in this case? * A) Price will increase until equilibrium B) Price will decrease until equilibrium C) Quantity will increase until equilibrium D) Quantity will decrease until equilibrium Calculate the quantity traded of carpets at...

A direct mapped cache has 16 blocks and block size is 64-bits (8 bytes). a. Where...

A direct mapped cache has 16 blocks and block size is 64-bits (8 bytes). a. Where will the memory block 45 reside in cache? (5 b. Where will be the memory address 1667 mapped in cache

An advantage of a physical address pointer is that a. it points directly to the actual disk storage .....

An advantage of a physical address pointer is thata. it points directly to the actual disk storage location.b. it is easily recovered if it is inadvertently lost.c. it remains unchanged when disks are reorganized.d. all of the above are advantages of the physical address pointer.

What happens to the size of atoms in p-block elements when we move from left to right in the same period? a) Size does not change b) Size increases then decreases c) Size increases d) Size decreases

What happens to the size of atoms in p-block elements when we move from left to right in the same period?a) Size does not changeb) Size increases then decreasesc) Size increasesd) Size decreases

6 C++ Questions: 19. Assuming an int is size 4 bytes, what is the size in...

6 C++ Questions: 19. Assuming an int is size 4 bytes, what is the size in memory of the below array: int cards[10] = {7, 4, 7, 5, 7}; 20. In the array from question 19, what is the value of the below elements: cards[1]; cards[8]; Assume you have an array with 128 integers which is sorted from lowest to highest. 21a. You are searching for a value which is contained in the array using the binary search algorithm. What...

A 0.78-kg block and a 0.56-kg block sits on a rotating disk. They are connecting by...

A 0.78-kg block and a 0.56-kg block sits on a rotating disk. They are connecting by a 12-cm long string. The coefficients of static and kinetic friction between the block and disk are µs = 0.87 and µk = 0.63, respectively. The cart is on wheels and moves frictionless. The distances of the block and the cart from the center of disk are 0.23 m and 0.35 m, respectively. The block and cart are sitting (i.e., are not moving) relative...

Consider a 4-way set-associative cache, 4 rows, a line size of 128 bytes and a write-back...

Consider a 4-way set-associative cache, 4 rows, a line size of 128 bytes and a write-back policy. The following requests are made to memory: Load: 0b0011111001000101 Load: 0b1000111110110100 Load: 0b0110101111110100 Store: 0b0010110000000110 Store: 0b1111001001110101 Store: 0b1110000111000001 Load: 0b0000000010100110 Load: 0b0101001001001101 Assuming the machine is in cold-start, profile the contents to the cache after all of the requests have been made. State any assumption you make (if needed).

To implement a recursive algorithm to calculates the total directory size (in bytes) of the portion...

To implement a recursive algorithm to calculates the total directory size (in bytes) of the portion of the file system rooted at the given path. Program will rely on the following methods of the class: new File(pathString) or new File(parentFile,childString) file.length() returns the immediate disk usage(measured in bytes) file.isDirectory() Returns true if the File instance represents a directory; false otherwise file.list() Return an array of strings designating the names of all entries within the given directory

Question