Consider the following code for some function FOO: FO0: bne $a0, $0, SUS addi $v®, $Ø, 1 #BASE CASE jr $ra SUS: add $v®, $0, $Ø addi $sp, $sp, -12 sw $ra, 0($sp) sw $a®, 4($sp) sw $v0, 8($sp) srl $a®, $a®, 1 jal F00 sw $v®, 8($sp) Lw $a®, 4($sp) addi $a®, $a®, 1 srl $a®, $a®, 1 jal F00 Lw $ra, 0($sp) Lw $t0, 8($sp) addi $sp, $sp, 12 add $v®, $v®, $t® jr $ra If FOO(2) is evaluated, where is the stack pointer when the base case is first reached, relative to the initial stack pointer at the first invocation of FOO O -24 words -12 bytes -24 bytes

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
i will dislike if no explanation is givencontact me at-halkhoori85@-gma-il.com to help me one-to-one
Consider the following code for some function FOO:
F00:
bne $a®, $0, SUS
addi $v®, $Ø, 1
#BASE CASE
jr $ra
SUS:
add $v®, $0, $0
addi $sp, $sp, -12
sw $ra, O($sp)
sw $a®, 4($sp)
sw $v®, 8($sp)
srl $a0, $a®, 1
jal F00
sw $v®, 8($sp)
Lw $a®, 4($sp)
addi $a®, $a®, 1
srl $a®, $a®, 1
jal F0O
Lw $ra, 0C$sp)
Lw $t0, 8($sp)
addi $sp, $sp, 12
add $v®, $v®, $t0
jr $ra
If FOO(2) is evaluated, where is the stack pointer when the base case is first reached, relative to the initial stack pointer at the first
invocation of FOO
-24 words
O -12 bytes
O -24 bytes
-48 words
O -12 words
O -48 bytes
Transcribed Image Text:Consider the following code for some function FOO: F00: bne $a®, $0, SUS addi $v®, $Ø, 1 #BASE CASE jr $ra SUS: add $v®, $0, $0 addi $sp, $sp, -12 sw $ra, O($sp) sw $a®, 4($sp) sw $v®, 8($sp) srl $a0, $a®, 1 jal F00 sw $v®, 8($sp) Lw $a®, 4($sp) addi $a®, $a®, 1 srl $a®, $a®, 1 jal F0O Lw $ra, 0C$sp) Lw $t0, 8($sp) addi $sp, $sp, 12 add $v®, $v®, $t0 jr $ra If FOO(2) is evaluated, where is the stack pointer when the base case is first reached, relative to the initial stack pointer at the first invocation of FOO -24 words O -12 bytes O -24 bytes -48 words O -12 words O -48 bytes
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 4 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY