The following figure depicts an i-node: File attributes Address of block 0 Address of block 1 Address of block 15 Block of pointers Disk block with additional addresses This i-node contains 16 direct addresses and a pointer to the block with additional ad- dresses. Addresses take 16 B each and block size is 4 KiB = 4096 B. (a) Draw a figure that depicts the i-node and the corresponding data blocks for a file of size 15 KiB. (b) What is the largest possible file size if the block with additional addresses is not used? What if we also use the block with additional addresses (where the block with additional addresses cannot further be extended)? (c) How much space on the disk is occupied by a file of size 75 KiB?

The following figure depicts an i-node: File attributes Address of block 0 Address of block 1 Address of block 15 Block of pointers Disk block with additional addresses This i-node contains 16 direct addresses and a pointer to the block with additional ad- dresses. Addresses take 16 B each and block size is 4 KiB = 4096 B. (a) Draw a figure that depicts the i-node and the corresponding data blocks for a file of size 15 KiB. (b) What is the largest possible file size if the block with additional addresses is not used? What if we also use the block with additional addresses (where the block with additional addresses cannot further be extended)? (c) How much space on the disk is occupied by a file of size 75 KiB?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 13RQ: How is an array stored in main memory? How is a linked list stored in main memory? What are their...

See similar textbooks

Similar questions

1.5 Pointers can be used to dynamically allocate storage from the at 1.6 When using raw pointers and dynamic storage allocation, we must always de- allocate the used storage by using to prevent
CSC 472 Introduction to Database Systems Project Consider the CLOCK page replacement policy. Assume that there are only 3 page slots available in the buffer pool. If a page reference sequence is: 0, 4, 1, 4, 2, 4, 3, 4 (in order from left to right). What happens when the second 4 (i.e., the 4 underlined with blue color) is referenced? Group of answer choices Its reference bit is set to 1. Its reference bit is set to 0. It is evicted. Nothing changes.
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
lices Font Peragrsoh Diraving Example: • Move a block of N consecutive bytes of data starting at offset address BIK1ADDR in memory to another block of memory locations starting at address Blk2ADDR. Assume that both blocks are in the same data segment whose starting point is defined by the data segment value DATASEGADDR. 11 Steter
Using C Language In this function, b has the address of a memory buffer that is num_bytes long. The function should repeatedly copy the 16 byte pattern that pattern16 points at into the memory buffer until num_bytes have been written. If num_bytes is not a multple of 16, the final write of the 16 byte pattern should be truncated to finish filling the buffer. void memset16(void *b, int num_bytes, void *pattern16) For example if the 16 bytes that pattern16 points at is 00 11 22 33 44 55 66 77 88 99 aa bb cc dd ee ff, then memset(b, 20, pattern16) should write to the buffer pointed at by p the 20 bytes 00 11 22 33 44 55 66 77 88 99 aa bb cc dd ee ff 00 11 22 33. Use SSE instructions to improve efficiency. Here's pseudocode. x = SSE unaligned load from pattern16while (num_bytes >= 16) SSE unaligned store x to p advance p by 16 bytes decrement num_bytes by 16while (num_bytes > 0) store 1 byte from pattern16 to p advance p by 1 byte advance pattern16 by 1 byte…
Code a descriptor that describes a data memory segment that grows upward and begins at location 03000000H and ends at location 05FFFFFFH and can be written. The memory has not been accessed, and can be accessed with the lowest privilege level. Assume that the segment is available (i.e., AV=1) and that the instructions are 32 bits (i.e., D=1).
.2: Below is a list of 32-bit memory address references, given as word addresses. 3, 180, 43, 2, 191, 88, 253 For each of these references, identify the binary address, the tag, and the index given a direct- mapped cache with 16 one-word blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with 2-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with 4-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty.
3. Calculate the physical memory location for each of the following cases? a- The logical address D470H in the extra segment. b- The logical address 2D90H in the stack segment. C- MOV [BP],AL if BP=2C30H. Assume ES=52B9, SS=5D27, DS=E000, and CS=B3FF.
Program binaries in many systems are typically structured as follows. Code is stored starting with a small fixed virtual address such as 0. The code segment is followed by the data segment that is used for storing the program variables. When the program starts executing, the stack is allocated at the other end of the virtual address space and is allowed to grow towards lower virtual addresses. What is the significance of the above structure on the following schemes: a. contiguous-memory allocation b. pure segmentation c. pure paging
1. Write a program to store 5 consecutive bytes of data into the data segment. The first data element should be 1 and the data should be stored starting from offset position 10H. 2. Write program to exchange the contents of AL and BL using the stacks. The initial values of AL should have 4CH and BL should have 55H. 3. In the above programs, write the physical addresses of all the segment registers, as well as the logical addresses.
Paging: Select all of the following statements that are true. Systems that use paging but do not support inverted page tables maintain at least one separate page table for each process. The frame table is a system-wide data structure. When paging is applied, the selected page size determines which part of a virtual address belongs to the page number and which to the offset. The page size may differ from the frame size. The Translation Look-aside Buffer (TLB) represents a page directory for all pages in the system. Paging is prone to internal fragmentation.
Memory address Data According to the memory view given below, if RO = Ox20008002 then LDRSB r1, [r0, #-4] is executed as a result of r1 = ?(data overlay big endian)? Øx20008002 ØXA1 Øx20008001 ØXB2 Øx20008000 Øx73 ØX20007FFE ØXD4 ØX20007FFE Lütfen birini seçin: O A. R1 = 0X7F O B. R1 = Oxffffffd4 O C. R1 = Oxffffff7F O D. R1=0XD4000000 O E. R1 = 0XD4