in assembly language mips 2x3 - 3x? + 5х + 12Use symbolic addresses for variables x and answer (holds the result). Assume that the value in x issmall enough so that all results fit into 32 bits. Since load delays are turned on in SPIM be careful whatinstructions are placed in the load delay slot.Verify that the program works by using several initial values for x. Use x = 0 and x = 1 to start since thiswill make debugging easy. Then try some other values, such as x = 10 and x = -1.Write the program following the hardware rule that two or more instructions must follow a mfloinstruction before another mult instruction (the delay slot). Try to put useful instructions in the delayslots that follow the mflo.

Answered: Image /qna-images/answer/26547c35-e58a-46a3-b850-a5805ab79530.jpg

Answered: 2x3 - 3х? + 5х + 12 Use symbolic…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question: Show the execution of each line of the given MIPS Code for $s0 = 0xA starting from“Main” till the code reaches “End”.Main: ble $s0, $0, Endsub $a0, $s0, $0Jal FuncJ EndFunc: add $v0, $0, $0Loop: addi $v0, $v0, 1srl $a0, $a0, 1bgt $a0, $0, LoopRet: jr $raEnd:
In the previous answers:Isn't 1 is supposed to be subtracted from the 64 as well? Malloc for x: Requested size: 10k Address returned to the caller: 32k + 1k = 33k (since x will be placed after the header of 1k) Address returned to the program: 33k Remaining free memory: 54k (64k - 10k) (here) Address of the remaining free memory: 43k andHere, the requested size is 20, why is 10 subtracted? Malloc for y (again): Requested size: 20k Address returned to the caller: 44k (previous address) Address returned to the program: 44k (previous address) Remaining free memory: 54k (64k - 10k) (here) Address of the remaining free memory: 64k
Q3. IF PC= 682 , AR=123 , DR=A2BF, IR= 5672, then execute the following M[AR] DR IR M[AR] Determine the value of IR after the execution and comment on the type of addressin
Suppose the Vole communicates with a printer using the technique of memory-mapped I/O. Suppose also thataddress 0xFF is used to send characters to the printer, and address 0xFE is used to receive information about theprinter’s status. In particular, suppose the least significant bit at the address 0xFE indicates whether the printeris ready to receive another character (with a 0 indicating “not ready” and a 1 indicating “ready”). Starting ataddress 0x00, write a machine language routine that waits until the printer is ready for another character and thensends the character represented by the bit pattern in register 0x5 to the printer.
**Please do A or C** a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the…
**Please do C****C IS different from B** a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given…
Can the following code sequence execute without stalling or forwarding ? addi x18, x0, 1addi x19, x0, 2addi x20, x0, 2addi x21, x0, 4addi x22, x0, 5
Suppose the DES Mangler function mapped every 32-bit value to zero, regardless of the value of its input, what function would DES compute? Solve this question by answering the following 3 sub-questions. What is the result of each round? What is the result after the 16 rounds? Remind DES = Initial permutation + 16 rounds + swap halves + final permutation? Assume the original message is a 64-bit message, i.e., 1 2 3 4 … 64. Specify the bit positions by then end of these 4 operation. Must provide detailed explanation of the calculation steps.
Suppose the DES Mangler function mapped every 32-bit value to zero, regardless of the value of its input, what function would DES compute? Solve this question by answering the following 3 sub-questions. What is the result of each round? What is the result after the 16 rounds? Remind DES = Initial permutation + 16 rounds + swap halves + final permutation? Assume the original message is a 64-bit message, i.e., 1 2 3 4 … 64. Specify the bit positions by then end of these 4 operation. Use 8x8 matrix for this. Must provide detailed explanation of the calculation steps.
A 32-bit computer has a memory of 256 KB and a cache line size of 64 bytes. The memory cache access time is 5ns. This cache is 4-way associative and use LRU as a replacement algorithm. a) What is the number of lines and sets of this memory cache? b) What is the block size transferred between the cache memory and the main memory? c) If the time to transfer a line to cache memory is 200 ns, what is the hit ratio needed to obtain an average access time of 20 ns?
A set of eight data bytes is stored in memory locations starting from XX70H. Write a program to add two bytes at a time and store the sum in the same memory locations, low order sum replacing the first byte and a carry replacing the second byte. If any pair does not generate a carry, the memory location of the second byte should be cleared. Data(H) F9, 38, A7, 56,98,52, 8F, F2
This solution is giving me error and you can add x310A that is out of range ORIG x3000 LEA R2, xFF ; R2 = x3000 + x1 + xFF = x3100 start of data LDR R3, R2, x0 ; R3 = value from address present in R2+0 Loop: NOT R4, R3 ; R4 = NOT R3 ADD R4, R4, #1 ; R4 = R4 + 1, find 2's complement of 5 ADD R4, R4, #5 ; R4 = R4 + 5 BRZ Found ; if result is zero, goto label Found LDR R3, R2, x1 ; R3 = value from address present in R2+0 NOT R4, R2 ; R4 = Not R2 ADD R4, R4, #1 ; R4 = R4 + 1, find 2's complement ADD R4, R4, x310A ; R4 = R4 + x310A, check if last memory crossed BRZ End; if yes then goto label End BR Loop ; else goto Loop Found: ADD R5, R5, #1 ; found hence R5 = 1 End: END ; end of the program

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS