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
- . The classical Tower of Hanoi (ToH) puzzle is well-known. It consists of three pegs and disks of sizes 1,2, . . . , n arranged on one of the pegs as a “tower”, in decreasing order of size, from bottom to top. The goal of the puzzle is to transfer all disks to another peg, placed in the same order. At each step, a single disk is moved from (the top of) one peg to (the top of) another, subject to the “divine” rule: to never have a larger disk above a smaller one.2. The computer in mars has a fivenary memory - that is each location can hold a frit value, with a frit holding 0, 1, 2, 3, or 4. How many frits are needed to hold a 6-octal_bit number. Give an expression for the number of frits to hold n octal bits.Consider a program consists of five segments: S0 = 600, S1 = 14 KB, S2= 100 KB, S3 =580 KB and S4 = 96 KB. Assume at that time, the available free space partitions of memory are 1200–1805, 50 – 150, 220-234, and 2500-3180.Find the following:a. Draw logical to physical maps and segment table?b. Allocate space for each segment in memory?c. Calculate the external fragmentation and the internal fragmentation?d. What are the addresses in physical memory for the following logical addresses: 0.580, (b) 1.17 (c) 2.66 (d) 3.82 (e) 4.20?
- 1. Illustrate the program execution for the following program. The hypothetical machine has four (4) opcodes: 0110 = LOAD 0101 = STORE 1011 = AND 0011 = ADD i) LOAD AC from memory location CM7. The content of this location is 510. ii) Logically, AND the content of memory location CM8. The content of this location is 510. iii) ADD the content of memory location CM9. The content of this location is 616. iv) STORE the content of AC to device 7. The address of device 7 is DE7. Assume that a value of A00 is the starting value contained in PC.Assume that A and B are arrays with elements of the arrays as 4-byte integers and registers ($56) and $57 contain the base address of A) and 6, respectively. Assume A(1) - 100 +1 for i 0,1... 10 (1.e., A(0)-100, A(1)-101,...); and B(1)-1 for 1-8, 1,..., 10 (i.e. B(e)-8, B(1)-1, ...). Let registers Sso, Ss1, $52, 553 have the initial values of 0, 0, 2, 2, respectively. Loop: sll $t0, $s0, 2 Exit: After completing the loop, the values of A and B are A(0) - add $t0,$t0, $56 lw $t3, 0($10) add $14.$13,3 sw $t4,0($t0) sll $t1,$s1, 2 add $t1,$t1,$s7 lw $t5, 0($11) add $13,$t3,$t5 sw $t3,0($t1) addi $50, $s0. 1 addi Ss1, Ss1, 1 addi $s3, $s3.-1 bne $s3, $0. LOOP B(0) ,A(1)- B(1)- A(2)- B(2)- .A(3)- , B(3)-Question 3: On a byte addressable machine a string COMSATS UNIVERSITY ISLAMABAD PAKISTAN, starting from logical address 0 (zero) to 36 is to be loaded into memory, in noncontiguous fashion, using 'Paging' technique. The string is divided mechanically into equal sized pages of 4 bytes; similarly the memory is also divided into equal sized frames of 4 bytes. The ASCII code of each Character occupies one byte. The free frame list is given as follows: 8,3,4,2,6,7 ,5,1,9,21,24, 11 Answer the following questions a. What is the page map table? b. What are the linear logical addresses of characters 'U' and_'B'? c. What are the linear physical addresses of characters 'U' and_'B'? d. What is the difference between Internal and External fragmentation? e. What is the internal fragmentation in loading given string?
- Q5. According to legend, the monks in a remote mountain monastery knew how to predict when the world would end. They had a set of three diamond needles. Stacked on the first diamond needle were 5 gold disks of decreasing size. The monks moved one disk to another needle each hour subject to the following rules. (COO1) Only one disk could be moved at a time. A Larger disk must never be stacked above a smaller one. One and One auxiliary needle could be used for the intermediate storage of disks. The legend said that when all 5 disks had been transferred to the destination needle, the stars would be extinguished and the world would end.Solve the above problem using recursion and draw a step by step procedure till the disks are transferred from source to destination.Question 2 You are running a program that performs a data summation operation with a supercomputer with 32768 computing nodes (i.e., processing unit: CPU). Assume that the data has 100,000 numbers, measure (1) total running time, (2) speedup, and (3) efficiency. You can calculate the approximated time (not exact time). Please note that there are several assumptions as Computation - Each PE can add two numbers stored in its local memory in one second. Communication - A PE can send data from its local memory to the local memory of any other PE in three seconds (independent of the size of the data). Each PE can send data elements from one PE to another. Input and output - At the beginning of the program, the whole input array A is stored in PE #0. In the end, the result should be gathered in PE #0. Synchronization - All PEs operate in a lock-step manner; i.e., they can either compute, communicate, or be idle. Use the editor to format your answerThe 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…
- Computer Science Write a script file to make a table with x and y columns with 100 rows and plot the curve y as a function of x, where y(x)=sin(ax)-cos(bx). The values a, b, and range of x must be entered through input. Demonstrate that your program script file works for the case a is 8 and b is 2 and in addition plot x from 0 to 2π. Label the axis x and y of the figure.One method that can be used to compress text data is run length encoding (RLE). When RLE is used the compressed data can be represented as a set of character/frequency pairs. When the same character appears in consecutive locations in the original text it is replaced in the compressed text by a single instance of the character followed by a number indicating the number of consecutive instances of that character. Single instances of a character are represented by the character followed by the number 1. Figure 9 and Figure 10 show examples of how text would be compressed using this method. Figure 9 Original text: AAARRRRGGGHH Compressed text: A 3 R 4 G 3 H 2 Figure 10 Original text: CUTLASSES Compressed text: C 1 U 1 T 1 L 1 A 1 S 2 E 1 S 1 What you need to do Task 1 Write a Python program that will perform the compression process described above. The program should display a suitable prompt asking the user to input the text to compress and then output the compressed text. Task 2 Test…Q2- The sum of a 100 * 100 matrix (total 10000 number) of floating point numbers is calculated using a parallel program that runs on 10 processors. A single floating point addition of two numbers takes 4 micro seconds. A- Using Amdahl's formula what is the execution time of calculating this sum if each of the 10 processors gets an equal balanced work load. B- Using Amdahl's formula what is the execution time of calculating this sum if one processor gets 2000 numbers of the total work load to sum and the other 9 processors each get an equal load out of the remaining 8000 numbers work load.