If a program has 956 bytes and will be loaded into page frames of 150 bytes each, and the instruction to be used is at byte 332, answerthe following questions: a. How many pages are needed to store the entire job? b. Compute the page numberand exact displacement for each of the byte addresses where the data is stored. (Remember that page numbering starts at zero).

Suppose we have the following memory structure. Address 0x402C 0x4028 0x4024 0x4020 1C 40 FF 20 1h $t1, lb $t2, sw $t2 1h $s1 56 2E 88 28 0x4022($0) -3 ($t1) 4($t1) 6($t1) Memory Content 78 44 DA 22 After the following code is executed, find the contents of the registers ($t1, $t2, and $s1) and the memory contents of each memory address. Code D2 2C 66 4E

The following data segment starts at memory address 1000h (hexadecimal) .data printString        BYTE   "ASSEMBLY IS FUN",0 moreBytes       BYTE  25(DUP)0 dateIssued      DWORD   ? dueDate           DWORD   ? elapsedTime    Word     ? What is the hexadecimal address of dueDate ?  a. 1045h b. 1029h c.1010h d. 102Dh

Consider the following problem:You are given a tower of n disks and three pegs. Disks are initially stacked in decreasing size (from the largest in the bottom to the smallest at the top) on one of the pegs. The objective is to transfer the entire tower to one of the other pegs (the third, let’s say), moving only one disk at a time and never a larger one onto a smaller one. (1) Write a code/pseudocode that uses the divide and conquer technique to solve the problem. (2) Write a recurrence relation for the time complexity of the problem and explain how you came up with the relation. (3) then express the time taken by your algorithm in Big-O notation.

Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. How many bits are used for the page number? How many bits are used for the offset? 8 bits each. With this system, what’s the maximum number of pages that a process can have? 256 Suppose that each entry in the page table comprises 4 bytes (including the frame number, the valid bit, and miscellaneous “bookkeeping bits”). An OS uses an array to store the page table. What is the size of the page table? 1024 Bytes Furthermore, suppose the first 6 pages of a process map to frames 222 to 227 (as decimal numbers), and the last 5 pages of the process map to frames 1 to 5 (also decimal numbers). All other pages are invalid. Draw the page table, including the valid bit and the frame number. DONE Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert…

I have a little bit problem with my late quiz for computer architecture, I get the answer from my lecturer but I still don't feel fully understand, can I ask for some help: In a computer system, the memory has 32 blocks and the cache has 8 blocks. Assume there is only one word per block with 4 bytes in one word. The reference sequence in terms of word location is 0, 2, 4, 10, 5, 12, 8, 18, 13. If the cache is direct-mapped, how many misses do we have if the cache is initially empty? Can you give the hit or miss for each reference?

Assume you now have 1kB of memory, i.e. the memory address space runs from 0 to 1023. The starting address of the first word is 0, the second word is 4, the third word is 8, and so on. The last word comprising 4 bytes resides in addresses 1020, 1021, 1022, 1023. Thus, the last word starts at 1020, which is a multiple of 4.  Now assume the same 1kB of memory but now, word size is 64 bits. The starting address of the first word is 0, the second, third, and last word starts at? my answer: (correct) the second is equal to  = 8 the third is equal to  = 16       help me  find the last word

Convert the following Compact Memory Notation diagram into an Array Memory Notation diagram. Assume the addresses are 4-bit binary values and the data are 8-bit binary values. Hint: The solution to this question is simply the reformatted diagram in Array Notation.

A 2-way set associative cache consists of four sets. Main memory contains 2K blocks of eight words each. Show the main memory address format that allows us to map addresses from main memory to cache. Be sure to include the fields as well as their sizes. Compute the hit ratio for a program that loops 6 times from locations 8 to 51 in main memory. You may leave the hit ratio in terms of a fraction. Please show details how you obtain the result.

Giventhe following assignment of some program’s virtual pages to physical pages in a system with 4 KiB byte pages, what physical memory address corresponds to virtual address 20000? (All values are given in decimal.)