Homework 1: Suppose in sizing up the data storage requirements for a word processing system to be used in production of a book, it is required to calculate the information capacity. The book consist of 450 pages, 500 words per page, each containing 5 symbols are chosen at random from a 37- ary alphabet (26 letters, 10 numerical digits and one blank space). Calculate the information capacity of the book.
Q: Consider a file whose size varies between 2KB and 8MB during its lifetime. It is required that the…
A: Explanation: Here, the file size varies between 2KB and 8MB during its lifetime. One can use…
Q: a. Represent the allocations with the help of a figure or table. b. Which algorithms of the three…
A: To do: a) Represent the allocations with the help of a figure or table b) which algorithms of the…
Q: Example-8.4 Consider a UNIX filesystem with the following components: Disk blocks are 096 bytes.…
A: Solution : As the details given, here are the answer.
Q: Question # 3 Suppose your system has a memory of size 100 MB using contiguous memory allocations and…
A: Solution. Given, Memory size = 100 MB Size of partition 1 = 50 Size of partition 2 = 200 Size of…
Q: Flash storage:a. How is the flash translation table, which is used to map logical pagenumbers to…
A: Flash storage is a non-volatile storage system. This results that the data it stores is retained…
Q: Consider a memory of size 8KB (8192 bytes) that allows dynamic, variable sized partitioning among…
A: ans :: As given in the question, P1 is allocated 500 bytes of memoryBase address BA = 2000Updated…
Q: Given the following information:Job List:Memory Block List:JobNumber MemoryRequested Memory Block…
A: Memory block Memory block refers to a digital memory that uses Saifun NROM Technology and is…
Q: Part(c) : Assume a hypothetical system with eight 32-bit words cache and small Main memory of 1 KB…
A: the solution of part c is given below :
Q: Consider the following scenario: we have a byte-addressable computer that uses two-way set…
A: INTRODUCTION: Virtual Memory Organization: The memory hierarchy of a modern computer system is a…
Q: Consider now a fully associative cache where each cache line holds 32 words. The machine word (the…
A: Actually, cache is a one of the memory. It is a fast access memory. It is located in between cpu and…
Q: Consider the following nested loop construct. Categorize its efficiency in terms of the variable n…
A: Categorization of efficiency in terms of “n” using “big-o” notation:The statement “x*=2” is given in…
Q: Q1) Consider a machine with a byte addressable main memory of 2 bytes and block size of 4 bytes.…
A: Solution: Q. How is a 12-bit memory address divided into tags? line number. and byte number? A.…
Q: Consider a program consists of five segments: S0 = 600, S1 = 14 KB, S2= 100 KB, S3 =580 KB and S4 =…
A: (a) 0.580 S = 0, d = 580 Base for S0 = 1200 and limit = 600 Therefore, Physical address = 1200 + 580…
Q: Suppose the price of memory falls by half, and the speed of disk access (number of accesses per…
A: Answer: Below is the detailed answer:
Q: Given a computer with a memory system having a40_bit address, a cache consisting of 8192 blocks each…
A: The Answer is
Q: QUESTION 15 In segmentation, the physical memory is divided into segments while logical memory is…
A: Segmentation is a memory allocation technique where memory is divided into unequal partitions of…
Q: 1. Consider a main memory with size 4GB with cache size 16 KB and memory block is 8 byt Assume that…
A: Dear Student, a) As 4GB of main memory is there also 4GB = 2^32 bytes , here we have taken bytes as…
Q: Consider a disk with block size B = 512 bytes. A block pointer is P = 6 bytes long, and a record…
A: a)Record Length R= (30+9+9+40+10+8+1+4+4)+1=116 b) Blocking factor bfr = floor (B/R) =…
Q: Consider a virtual memory system providing 32 pages for each user program; the size of each page is…
A:
Q: Consider a file system on a disk that has both logical and physical block sizes of 512 bytes.…
A: Let Z be the starting file address (block number). Contiguous-Divide the logical address by 512 with…
Q: Q.5: Suppose we have the following pseudocode: function 0 0 ( function 10: loop (from 0 to 1, 000,…
A: For the above given question the solution is given below:
Q: 6. Suppose we are given the following subset of codewords, created for a 7-bit memory word with one…
A: • Parity bit:An Parity bit is a little, affixed at the LSB (Least Significant Bit) side of the given…
Q: List of partitions and processes Show how these SIX (6) processes are allocated into memory…
A: Summary:Storage allocation strategy decides how a request for a memory block of given size N can be…
Q: A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure…
A: Introduction Given, A disk of size 2 TB , multilevel inode structure. Disk block size is 512 B .…
Q: Assume that we have a computer with a cache memory of 512 blocks with a total size of 128K bits.…
A: Given the cache's capacity of 128K bits. Cache capacity in bytes = 128K bits / 8 = 16KB Because this…
Q: Suppose a computer system has a memory organization with only three levels of hierarchy, a cache, a…
A: AS PER OUR POLICY “Since you have posted a question with multiple sub-parts, we will solve the first…
Q: Q#3 Consider the dynamic memory layout shown below (the shaded blocks are already allocated) ,Draw…
A: First fit;- Allocate the process in the first free large enough partition Best fit;- Allocate the…
Q: Suppose a computer system has a memory organization with only three levels of hierarchy, a cache, a…
A: Data given- .
Q: 4. A system holds memory as shown in the figure below. (units in bytes) H P2 P3 150 50 100 P4 200 75…
A: First Fit It is appropriate to distribute the first requesting process to free or a whole large…
Q: 21. The idea of cache memory is based on a. The property of locality of reference b. The…
A: 1) The Idea of the cache memory is based on the property of Locality of reference 2) Locality of…
Q: .Q\/ '. Assume that DS={ •.•, SS=r.., BX=rl.., SI=\ £^1, DI=\º• •, BP=V^) £, AX=Yolr. All the values…
A: Values are not very clear in the question, hence assuming the values to be: DI=8500, SS=200,…
Q: Question Show how the following values would be stored bybyte-addressable machines with 32- bit…
A: NOTE: Based on our rules, when multiple questions are posted, we should answer only the first…
Q: 3. The available space list of a computer memory system is as follows: Starting Address Block Size…
A: Starting Address Block Size 300 150 600 275 900 110 1200 250 The request of block sizes:…
Q: For Heap File with a page directory, assume that a page can contain up to 100 directory entries and…
A: Given Statement: In this question firstly we will find out what is already given in our question.…
Q: Consider the following nested loop construct. Categorize its efficiency in terms of the variable n…
A: The inner while loop runs n times as y=n. Hence, the big-o of the inner loop will be O(n).Next, in…
Q: Consider a file system that uses indexed file allocation. Disk block size is 1K-byte, and a file…
A: Given that, Disk block size= 1K byte= 1024 bytes File pointer size= 8 bytes Number of direct…
Q: Assume there are 200 KB, 600 KB, 300 KB, 400 KB, and 700 KB memory partitions. These divisions are…
A: Intro In given question, we have partitions and i have assumed partitions are fixed that means only…
Q: Consider a computer with a cache memory of 1024 blocks and a total size of 512K bits. This computer…
A: Provided the solution for all the above given questions with detailed step by step explanation as…
Q: Suppose we have a system with the following properties:The memory is byte addressable.Memory…
A: 1. Cache size = total number of blocks*size of block Block size = 4B Total number of block = 8*4 =…
Q: QUESTIONS Q1) Consider a machine with a byte addressable main memory of 2" bytes and block size of 8…
A: According to the information given:- We are consider the mention scenario and give appropriate…
Q: Assume th at we have a computer with a cache memory of 512 blocks with a total size of 128K bits.…
A: Note: In the BNED Guidance, only the first question can be answered at a time. Resend the question…
Q: Let us consider a file system which uses inodes to manage files on disk where each inode consists of…
A: According to question bytes to be divided like:
Q: We study the properties of cache memory, and for reasons of easier design and efficient circuits, we…
A: Let the total number of bits for main memory be m bits. C. Number of bits for byte offset is log…
Q: Q4 Use the input bellow to answer the following questions: RAM size = 1 MB , The logical address…
A: Answer
Q: 1. Show how the following values would be stored bybyte-addressable machines with 32- bit words,…
A: Answer 1: A: 56789ABC16 Address Big Endian Little Endian 301816 56 16…
Q: 8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of head is…
A: Solution:- Above all question can be solved as:-
Q: 17- Consider a computer with the following characteristics: total of 1Mbyte of main memory: word…
A: Answer:-
Q: 8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of head is…
A:
Q: i. Consider the free memory layout shown below (the blocks are ordered from top to bottom). Draw to…
A:
Step by step
Solved in 2 steps
- A computer of 32 bits has a cache memory of 64 KB with a cache line size of 64 bytes. The cache access time is 20 ns, and the miss penalty is 120 ns. The cache is 2-way associative. a) What is the number of cache lines? b) What is the number of cache sets? c) What is the number of lines per set? d) Draw a scheme of this cache. e) Calculate the time to read a word in case of miss.Consider the following nested loop construct. Categorize its efficiency in terms of the variable n using “big-o” notation. Suppose the statements represented by the ellipsis (...) require four main memory accesses (each requiring one microsecond) and two disk file accesses (each requiring one millisecond). Express in milliseconds the amount of time this construct would require to execute if n = 1024. x = 1; do { y = n; while (y > 0) { ... y--; } x *= 2; } while (x < n*n);Consider a Data file of r=30,000 EMPLOYEE records of fixed-length, consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. Calculate the record size R in bytes. Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization. Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr .
- Question Show how the following values would be stored bybyte-addressable machines with 32- bit words, using little endianand then big endian format. Assume each value starts at address301816. Draw a diagram of memory for each, placing the appropriatevalues in the correct (and labeled) memory locations. a. 56789ABC16 b. 2014111910 The memory unit of a computer has256K words of 32 bits each. The computer has an instruction formatwith 4 fields: an opcode field; a mode field to specify 1 of 7addressing modes; a register address field to specify one of 16registers; and a memory address field. Assume an instruction is 32bits long. Answer the following: a. How large must the mode field be? b. How large must the register field be? c. How large must theaddress field be? d. How large is the opcode field? 4. In a computerinstruction format, the instruction length is 12 bits and the sizeof an address field is 4 bits. Is it possible to have: 13 2-address instructions 45 1-address instructions…The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes 1 msec to satisfy a request from the cache, but 40 msec to satisfy a request if a disk read is needed, give a formula for the mean time required to satisfy a request if the hit rate is h. Plot this function for values of h varying from 0 to 1.0. Explain your logic and justify the structure of the formula.CA_6 We study the properties of cache memory, and for reasons of easier design and efficient circuits, we assume that the cache capacity is 2i Bytes, and cache line size is 2j Bytes, with i and j being natural numbers: (a) How many bits should the tag field have? And can the tag field contain 0 bit (i.e., be empty)? Elaborate (b) Repeat the above for the index field. (c) Repeat the above for the byte-offset field. (d) Finally, depict a figure showing a cache line, indicate what fields it possibly has, state the possible sizes of these fields, and explain the uses of these fields.
- Assume there are 200 KB, 600 KB, 300 KB, 400 KB, and 700 KB memory partitions. These divisions are correct. Allocate processes with parameters 312 KB, 517 KB, 212 KB, and 526 KB using the first fit, best fit, and worst fit algorithms, then answer the following: Use a figure or table to represent the allocations. 2.Which of the three algorithms uses memory the most efficiently?The Tower of Hanoi Problem Tower of Hanoi is a mathematical game consisting of three pegs (P1, P2 and P3) and a stack of disks of different diameters. Disks can slide onto any peg. The game starts with all disks stacked on P1 and ends at the point where all disks stacked on P3. The game player is required to move all disks from P1 to P3 using P2 as a buffer. Three rules must be followed when playing the game (1) Only one disk may be moved at a time. (2) Each move involves taking a disk on the top of a peg and place it on the top of another peg. (3) A disk of a larger diameter should never be placed on top of a disk of a smaller diameter. The diagrams below demonstrate the starting state and goal state of the game with 5 disks. starting sate p1 to goal state p3 Requirements In this assignment, students are required to solve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python. Two state space search algorithms: (1) a blind search (depth-first…Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer the following question: If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk?
- 1. In a certain device, the disk rotates at 5000rpm. a) how long does one revolution take? b) what is the average rotational delay of this disk drive 2. Consider a disk dirve with 1000 tracks, numbered 0 to 999. The request queue has the following composition: 300 740 150 940 200 850 145 555 775 695. The current position is 197 and the previous request was served at 100. For each of the following disk scheduling algorithsm, compute the total distance (in tracks) that the disk arm would move. Include the calculation steps in your answers. 2.1 First - In-First-Out (FIFO) 2.2 Shortest - Service-Time - First (SSTF) 2.3 SCAN (no LOOK variation) 2.4 C-SCAN (No C-LOOK variation)) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)Given the following information:Free Space ListPartition Size (KB) Queuing Processes Process Size (KB)A 500 P1 170B 350 P2 420C 150 P3 280D 400 P4 90E 350 P5 220F 200 P6 200 List of partitions and processes Show how these SIX (6) processes are allocated into memory partitions when the following allocation algorithms are applied. Give your answer using the following table format. Partition Partition Size Process Process size Internal Fragmentation…