Q2. Suppose $11 stores the base address of word array A and $s1 is associated with h, convertthe following instruction into MIPS.h = 0while (h <=A[h] = A[h+3]h = h + 2(Try to understand what the Python code does before proceeding to do the conversion)

Name: Q2. Suppose $11 stores the base address of word array A and $s1 is as
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Q2. Suppose $11 stores the base address of word array A and $s1 is associated with h, convertthe following instruction into MIPS.h = 0while (h <=A[h] = A[h+3]h = h + 2(Try to understand what the Python code does before proceeding to do the conversio

Program : h =0run a loop till less than equal to 30inside loop write the value of A[h+3] to A[h]so…

Engineering

Computer Science

Q2. Suppose $11 stores the base address of word array A and $s1 is associated with h, convert the following instruction into MIPS. h = 0 while (h <= 30): A[h] = A[h+3] h = h + 2 (Try to understand what the Python code does before proceeding to do the conversion)

Q2. Suppose $11 stores the base address of word array A and $s1 is associated with h, convert the following instruction into MIPS. h = 0 while (h <= 30): A[h] = A[h+3] h = h + 2 (Try to understand what the Python code does before proceeding to do the conversion)

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

Imagine a virtual memory system where the RAM can only store two pages at a time. Suppose a program makes the following sequence of page accesses: At time 0, page 5At time 1, page 1At time 2, page 5At time 3, page 2At time 4, page 5At time 5, page 3At time 6, page 5At time 7, page 4 Show at what points in time page replacements occur, and which pages are evicted, using the following page replacement algorithms:(a) FIFO(b) LRU
) 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)
Consider a program that declares global integer variables x, y[10]. Thesevariables are allocated starting at a base address of decimal 1000. All thesevariables have been initialized to zero. The base address 1000 has been placed in$gp. The program executes the following assembly instructions:lw $s1, 0($gp)addi $s1, $s1, 25sw $s1, 0($gp)lw $s2, 12($gp)add $s2, $s2, $s1sw $s2, 8($gp)sw $s2, 12($gp) What are the memory addresses of variables x, y[0], and y[1]? What are the values of variables x, y[0], y[1], and y[2] at the endof the program?
6. Assume a computer has 32-bit integers. Show how the value 0x0001122 would be stored sequentially in memory, starting at address 0x000, on both a big endian machine and a little endian machine, assuming that each address holds one byte. Address Big Endian Little Endian0x000 0x001 0x002 0x003
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.)
Consider the code sequence below lw $t1, 4($t0) add $s2, $t1, $t2 lw $t3, 16($t0) add $s3, $t3, $t2 lw $t4, 28($t0) add $s4, $t4, $t2 Suppose there is no forwarding allowed, and for the result of a lw to be consumed by the following R-type of instruction requires 2 bubbles to be placed between the two instructions. Is it possible for the scheduler to juxtapose the commands in such a way that there is no need for any bubbles? If yes, give an example of how it can be done.
Which of the following is NOT true of the C program construct a[b] ? Group of answer choices a) The array index should be computed as an rval b) If a is an array of int on MIPS starting at the address 0x800, then a[1] is at 0x804 c) On MIPS, it might use the same unsigned integer add instruction that is used to implement c+d where c and d are both int d) a[b] is not usable as an lval e) On MIPS, one would expect space for a[] to either be allocated on the stack or in the .data segment
(Practice) Although the total number of bytes varies from computer to computer, memory sizes of millions and billions of bytes are common. In computer language, the letter M representsthe number 1,048,576, which is 2 raised to the 20th power, and G represents 1,073,741,824, which is 2 raised to the 30th power. Therefore, a memory size of 4 MB is really 4 times 1,048,576 (4,194,304 bytes), and a memory size of 2 GB is really 2 times 1,073,741,824 (2,147,483,648 bytes). Using this information, calculate the actual number of bytes in the following: a. A memory containing 512 MB b. A memory consisting of 512 MB words, where each word consists of 2 bytes c. A memory consisting of 512 MB words, where each word consists of 4 bytes d. A thumb drive that specifies 2 GB e. A disk that specifies 4 GB f. A disk that specifies 8 GB
Consider the following instruction:Instruction: Add Rd, Rs, RtInterperation: Reg[Rd] = Reg[Rs] + Reg[Rt] RegWrite MemRead ALUMux MemWrite ALUOp RegMux Branch a, What are the values of control signals generated by the control in Figure 4.2 for the above instruction? b, Which resources (blocks) perform a useful function for this instruction? c, Which resources (blocks) produce outputs, but their outputs are not used for this instruction? d, which resources (blocks) produce no output for this instruction?
Answer only 3 and 4 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: (20) • Prog1 request 80KB, prog2 request 16KB, • Prog3 request 140KB • Prog1 finish, Prog3 finish; • Prog4 request 80KB, Prog5 request 120kb • Use first match and best match to deal with this sequence • (from high address when allocated) • (1)Draw allocation state when prog1,2,3 are loaded into memory? • (2)Draw allocation state when prog1, 3 finish? • (3)use these two algorithms to draw the structure of free queue after prog1 , 3 finish(draw the allocation descriptor information,) • (4) Which algorithm is suitable for this sequence ? Describe the allocation process?
Let $t0 have the address of integer variable i, and $t1 have the address of integer variable j. Give the C or Java style statement that is implemented by these assembly instructions? lw $t2, 0($t1) addi $t2, $t2, 1 sw $t2, 0($t0)
10.- Consider the following code and pictureLoop1MOVLW 0x32MOVWF REG2DECFSZ REG2,FGOTO LOOP1 If the system clock frequency is aMHz and each machine cycle consumes 4 cycles of it. Calculate the delay time of the LOOP1 loop. Include the execution difference time of the DECFSZ instruction in the last cycle. Select an answerA) 0.6.sB) 6msC)6usD) 60us