In the recursive factorial code given below, what happens if the instruction at line number 0x00400040 (addi $sp,$sp,8) is deleted by mistake from the following code? Ox00400028 fact: addi 0x0040002C 0x00400030 0x00400034 0x00400038 0x0040003C 0x00400040 0x00400044 0x00400048 L1: 0x0040004C 0x00400050 0x00400054 0x00400058 0x0040005C 0x00400060 SW SW siti beq addi addi jr addi jal Iw Iw $sp,$sp, -8 $ra, 4($sp) $a0, 0($sp) $t0, $a0, 1 $t0, $zero, L1 $v0, $zero, 1 $sp,$sp, 8 $ra $a0, $a0, -1 fact $a0, 0($sp) $ra, 4($sp) addi $sp,$sp,8 mult $v0, $a0,$v0 jr $ra Possible answers are as follows: a) Program enters an infinite loop and remains in the loop with the correct value stored in the vo register b) Program enters an infinite loop and remains in the loop with incorrect return value in the vo register c) Program enters an infinite loop and crashes due to memory access that exceeds the stack space

In the recursive factorial code given below, what happens if the instruction at line number 0x00400040 (addi $sp,$sp,8) is deleted by mistake from the following code? Ox00400028 fact: addi 0x0040002C 0x00400030 0x00400034 0x00400038 0x0040003C 0x00400040 0x00400044 0x00400048 L1: 0x0040004C 0x00400050 0x00400054 0x00400058 0x0040005C 0x00400060 SW SW siti beq addi addi jr addi jal Iw Iw $sp,$sp, -8 $ra, 4($sp) $a0, 0($sp) $t0, $a0, 1 $t0, $zero, L1 $v0, $zero, 1 $sp,$sp, 8 $ra $a0, $a0, -1 fact $a0, 0($sp) $ra, 4($sp) addi $sp,$sp,8 mult $v0, $a0,$v0 jr $ra Possible answers are as follows: a) Program enters an infinite loop and remains in the loop with the correct value stored in the vo register b) Program enters an infinite loop and remains in the loop with incorrect return value in the vo register c) Program enters an infinite loop and crashes due to memory access that exceeds the stack space

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

Implement the following C recursive function using RISC-V instructions. Use x6 to store the value of n. The return result should also be in x6. long long int func1 (long long int n) { if (n < 1) return 0; else return n + func1(n - 2); }
Write a program in assembly code (8086) to : Write a program to read a letter in lower case the convert this letter to upper case and print it. (to convert from lower to upper subtract from the value 20h)
Q3/ write a program to cout number of one's & zero's in a number stored at 0200:0010, use rotate instruction, store the result in the memory location 0200:0011 and 0200:0012 respectively.
What is the machine code of the instruction "BRnzp LOOP" according to the following program? Program: .ORIG х3000 LEA R1, INTE ; R1 is the location of the integer R3, R3, 0 ; R3 is the sum R2, R2, 0 ; R2 is the count of the integers AND AND ADD R2, R2, 12 LOOP BRz EXIT LDR R4, R1, 0 ADD R3, R3, R4 ADD R1, R1, 1 ADD R2, R2, -1 BRnzp LOOP EXIT TRAP x25 ; halt INTE .BLKW 12 .END Select one: а. ХОFFA b. XF025 С. х0403 d. x0405 е. XE9FF
7
According to the code given below, what is the value stored in the offset field of the "bne $t1, $a3, L1" instruction? L1: L2: L3: 06 0-7 07 S -8 8 sll sll add add add Iw add add Iw 28 32 add addi bne addi bne add add bne addi $a2, $a2, 2 $a3, $a3, 2 $v0, Szero, Szero $t0, $zero, Szero $14, $a0,$t0 $t4, 0($t4) $t1, $zero, Szero $t3, $a1, $t1 $13, 0($13) St3, $a1, $t1 $t1,$t1, 4 $t1, $a3, L1 Sto, Sto, 4 $t1, $a3, L2 $t1, $zero, Szero $13, $a1, $t1 $t1, $a3, L3 Sto, $to, 4