Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3.10, Problem 3.49PP
A.
Explanation of Solution
Logic in computation of
- The instruction “leaq 22(,%rdi, 8), %rax” computes value of “
- The instruction “andq $-16, %rax” rounds it to nearest multiple of 16
B.
Explanation of Solution
Logic in computation of p:
- The instruction “leaq 7(%rsp), %rax” loads value at offset “7+%rsp” to register “%rax”.
- The instruction “shrq $3, %rax...
C.
Explanation of Solution
Trace execution table:
| n | s1 | s2 | p | e1 | e2 |
| 5 | 2065 | 2017 | 2024 | 1 | 7 |
| 6 | 2064 | 2000 | 2000 | 16 | 0 |
Explanation:
- The “e1” denotes offset bytes between end of array “p” and position indicated by “s1”.
- The “e2” denotes offset bytes between values of “p” and “s1”.
- The given code computes value of “8n+8” if “n” is odd and value of “8n+16” if “n” is even.
- In this case, “n” is odd, the value computed is 48...
D.
Explanation of Solution
Alignment properties for values of
- The value of “
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Plz try
Language: C
Write a C program that allocates memory using the malloc function for an array of size specified by the user at runtime. Assign pseudo-random double values to the array elements, then sort the array using the qsort function. Using the examples from the lecture, define a function that compares numbers of type double. Pass the function address to the qsort function. Use the free function to free up memory.
Problem 1 and Problem 2.
2
DO NOT COPY FROM OTHER WEBSITES
Chapter 3 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 3.4 - Prob. 3.1PPCh. 3.4 - Prob. 3.2PPCh. 3.4 - Prob. 3.3PPCh. 3.4 - Prob. 3.4PPCh. 3.4 - Prob. 3.5PPCh. 3.5 - Prob. 3.6PPCh. 3.5 - Prob. 3.7PPCh. 3.5 - Prob. 3.8PPCh. 3.5 - Prob. 3.9PPCh. 3.5 - Prob. 3.10PP
Ch. 3.5 - Prob. 3.11PPCh. 3.5 - Prob. 3.12PPCh. 3.6 - Prob. 3.13PPCh. 3.6 - Prob. 3.14PPCh. 3.6 - Prob. 3.15PPCh. 3.6 - Prob. 3.16PPCh. 3.6 - Practice Problem 3.17 (solution page 331) An...Ch. 3.6 - Practice Problem 3.18 (solution page 332) Starting...Ch. 3.6 - Prob. 3.19PPCh. 3.6 - Prob. 3.20PPCh. 3.6 - Prob. 3.21PPCh. 3.6 - Prob. 3.22PPCh. 3.6 - Prob. 3.23PPCh. 3.6 - Practice Problem 3.24 (solution page 335) For C...Ch. 3.6 - Prob. 3.25PPCh. 3.6 - Prob. 3.26PPCh. 3.6 - Practice Problem 3.27 (solution page 336) Write...Ch. 3.6 - Prob. 3.28PPCh. 3.6 - Prob. 3.29PPCh. 3.6 - Practice Problem 3.30 (solution page 338) In the C...Ch. 3.6 - Prob. 3.31PPCh. 3.7 - Prob. 3.32PPCh. 3.7 - Prob. 3.33PPCh. 3.7 - Prob. 3.34PPCh. 3.7 - Prob. 3.35PPCh. 3.8 - Prob. 3.36PPCh. 3.8 - Prob. 3.37PPCh. 3.8 - Prob. 3.38PPCh. 3.8 - Prob. 3.39PPCh. 3.8 - Prob. 3.40PPCh. 3.9 - Prob. 3.41PPCh. 3.9 - Prob. 3.42PPCh. 3.9 - Practice Problem 3.43 (solution page 344) Suppose...Ch. 3.9 - Prob. 3.44PPCh. 3.9 - Prob. 3.45PPCh. 3.10 - Prob. 3.46PPCh. 3.10 - Prob. 3.47PPCh. 3.10 - Prob. 3.48PPCh. 3.10 - Prob. 3.49PPCh. 3.11 - Practice Problem 3.50 (solution page 347) For the...Ch. 3.11 - Prob. 3.51PPCh. 3.11 - Prob. 3.52PPCh. 3.11 - Practice Problem 3.52 (solution page 348) For the...Ch. 3.11 - Practice Problem 3.54 (solution page 349) Function...Ch. 3.11 - Prob. 3.55PPCh. 3.11 - Prob. 3.56PPCh. 3.11 - Practice Problem 3.57 (solution page 350) Function...Ch. 3 - For a function with prototype long decoda2(long x,...Ch. 3 - The following code computes the 128-bit product of...Ch. 3 - Prob. 3.60HWCh. 3 - In Section 3.6.6, we examined the following code...Ch. 3 - The code that follows shows an example of...Ch. 3 - This problem will give you a chance to reverb...Ch. 3 - Consider the following source code, where R, S,...Ch. 3 - The following code transposes the elements of an M...Ch. 3 - Prob. 3.66HWCh. 3 - For this exercise, we will examine the code...Ch. 3 - Prob. 3.68HWCh. 3 - Prob. 3.69HWCh. 3 - Consider the following union declaration: This...Ch. 3 - Prob. 3.71HWCh. 3 - Prob. 3.72HWCh. 3 - Prob. 3.73HWCh. 3 - Prob. 3.74HWCh. 3 - Prob. 3.75HW
Knowledge Booster
Similar questions
- Q7. ] Given the following ARM64 assembly code for a function, add comments to each line, use its stack frame with corresponding variables, and trace the code execution to figure out what it does. Notice that local variables are stored in the function's stack frame. Hint: this is a void function that takes two input parameters. tunct: sub sp. sp, #32 str x0, (sp, 8] Address Contents x1, [sp) Idr x0, Isp, 81 str SP Sp + 4 Sp +8 Sp + 12 Sp + 16 Sp + 20 Sp + 24 Sp + 28 Idr wo, [x0] str wo, [sp, 28] Idr x0, [sp) Idr w1, [x0] Idr x0, [sp, 8] w1, [x0] Idr x0, Isp) str Idr w1, [sp, 28] str w1, [x0] DOR add Sp. sp, 32 retarrow_forward62. For the base and offset addresses in problem 61, how many words of data are cur- rently held in the stack?arrow_forwardProblem 4 and Problem 5arrow_forward
- make this code work able instruction are given in picture #include<math.h> using namespace std; double lerpSingle(double a, double b, double t) { if (t <= 0.5) return a+(b-a)*t; else return b-(b-a)*(1.0-t); } // This is for linear interpolation Vector3 lerp(Vector3 u, Vector3 v, double t) { return Vector3(lerpSingle(u.x, v.x, t), lerpSingle(u.y, v.y, t), lerpSingle(u.z, v.z, t)); } // This is for identifying if 4 vectors are coplanar bool coplanar(Vector3 p, Vector3 q, Vector3 r, Vector3 s) { Vector3 ab = Vector3(q.x-p.x, q.y-p.y, q.z-p.z); Vector3 bc = Vector3(r.x-q.x, r.y-q.y, r.z-q.z); Vector3 cd = Vector3(s.x-r.x, s.y-r.y, s.z-r.z); if (dot(cross(ab,bc), cd) == 0) { return true; } else { return false; } } Below are the helper function I have used for your reference double dot(Vector3 u, Vector3 v) { double product = 0; product = u.x*v.x + u.y*v.y + u.z*v.z; } Vector3 cross(Vector3 u, Vector3 v) { double x = u.y * v.z - u.z * v.y; double y = u.z * v.x - u.x * v.z;…arrow_forwardWrite MIPS assembly for the following function. Assume N is passed to yourfunction in register $a0. Your output should be in register $v0 at the end of yourfunction. Note: You must implement this function recursively. The purpose of thisassignment is to learn how to manipulate the stack correctly in MIPS. int Myfun (int N){ if (N<3) return 1; return ( 2* Myfun(N-1)+ Myfun(N-2));}Please explain each instruction with a comment. Please submit your source codeand a screenshot that shows the registers with correct output value for N=3, i.e.,Myfun(3) returns 3 and Myfun(4) returns 7arrow_forwardFor each of the following problems, all functions should be implemented using a call stack. Problem 2: Write a program that defines two integer array that are pre-sorted and the same size (e.g., [3, 7, 9, 11, 15, 21] and [1, 4, 6, 14, 18, 19]) and a function merge that takes the two arrays (and their size) as inputs and populates a single array of twice the size of either input array that contains the elements of both arrays in ascending order. In the example arrays given, then output would be [1, 3, 4, 6, 7, 9, 11, 14, 15, 18, 19, 21]. Have your 'main' function (not the merge function) print out the final array using a comma as a delimiter.arrow_forward
- a-) The compare and swap() instruction can be used to design lock-free data structures such as stacks, queues, and lists. The program example shown in Figure 6.18 presents a possible solution to a lock-free stack using CAS instructions, where the stack is represented as a linked list of Node elements with top representing the top of the stack. Is this implementation free from race conditions? b-) Describe how the signal() operation associated with monitors differs from the corresponding operation defined for semaphores.arrow_forwardpython code. short codearrow_forwardWrite a C++ or Python program to read your full name in character array and reverse it using a stack . • Create a character array that can hold any name with a maximum of 50 characters • Create an array of the same size as the character array that can be used as an ADT ( Stack ) Read any user - given input ( name ) • Use stack operations to reverse the name • Your program must have the functions PUSH ( ) and POP ( ) • Show each step of output on the screen .arrow_forward
- 15. By MIPS convention, $sp is the stack point register holding the value of the ending memory position for the stack, and Sao is the (5) register for storing the first parameter of a call to a function named X. De-compile the following assemble codes back to the c/C++/Java function X. X: addi $sp, $sp, -8 $ra, 4 ($sp) $a0, o($sp) Sw Sw $t0, $a0,1 $t0, $zero, L1 slti # test for $a0 < 1, if not, $to gets 1, else $to gets o beg addi $vo, $zero,0 $sp, $sp,8 $ra addi jr L1: addi Şa0, $a0,-1 jal x $a0, 0($sp) $ra, 4($sp) addi $sp, $sp, 8 add $vo, Şao, $vo jr $ra lw lwarrow_forwardSelect the answer that indicates the truth and falsehood of each of the three statements below: 1) In the MIPS-32 ABI, the heap starts at a lower address and grows up, while the stack starts at a higher address and grows down. 2) The stack must start at the same location on any machine that implements the MIPS ISA. 3) Consider the case where a caller FOO of another function BAR wants to use the value in $t7 again after calling BAR: In this case, FOO does not need to do anything, because it is BAR's responsibility to restore all registers to their pre-call values. False, True, False False, False, True True, True, True False, False, False False, True, True True, True, False True, False, True True, False, Falsearrow_forwardQ.4 A pointer is a variable whose value is the address of another variable, i.e., direct address of the memory location. Given the C code and memory content mapping shown in Figure Q.4, complete the Table Q.4 to predict the value after program execution. RAM #include void calculate_average(char mark[], float "average, int size) 0x0010 0000 { for (int i=0; i< size; i++) { *average = "average + mark[i]; 0x0020 0000 average_mark } "average = "average / size; 0x0030 0000 ptr FLY int main() { 0x0040 0000 mark[0] char mark[5]=(50, 80, 95, 34, 99}; float average_mark = 0; mark[1] float *ptr=&average_mark; calculate_average(mark, ptr, 5); mark[2] mark[3] return 0; mark[4] Figure Q.4 Table Q.4 Variable Value a) ptr b) &ptr c) *ptr d) &mark[2] e) average_markarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning