Computer Systems: A Programmer's Perspective (3rd Edition)
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
Expert Solution & Answer
Book Icon
Chapter 7.7, Problem 7.4PP

A.

Explanation of Solution

Hex address of the relocated reference to “sum”:

From the given Figure 7.12(a), the function “sum” in line 5 is

4004de: e8 05 00 00 00callq 4004e8 <sum>sum()

From the given Figure 7.12(a), the value of “ADDR(s)”, “ADDR(r.symbol)” and “r.addend” is given below

ADDR(s)=ADDR(.text)=0x4004d0

r.offset=0xf

r.addend=-4

Now calculate the reference address for given line using the below formula.

refaddr=ADDR(s)+r

B.

Explanation of Solution

Hex value of the relocated reference to “sum”:

From the given Figure 7.12(a), the function “sum” in line 5 is

4004de: e8 05 00 00 00callq 4004e8 <sum>sum()

From the given Figure 7.12(a), the value of “ADDR(s)”, “ADDR(r.symbol)” and “r.addend” is given below

ADDR(s)=ADDR(.text)=0x4004d0

r.offset=0xf

r.addend=-4

Now calculate the reference address for given line using the below formula.

refaddr=ADDR(s)+r.offset

Then,

refaddr=ADDR(s)+r

Blurred answer
Students have asked these similar questions
Problem 15 (#2.3.30).If f and f◦g are one-to-one, does it follow that g must be one-to-one? Justify your answer.
3. The diagram below shows the main land routes for vehicular traffic between points A and G in a city. The figures in the arcs represent the cost of traveling between each pair of nodes.   a) Manually apply Dijkstra's algorithm to find the cheapest route between A and G (visited nodes and total distance). b) Formulate a linear programming problem in extended form, to determine the shortest route to travel from A to G. Do not use subscripts, name 14 variables, for example XFE would be the variable that indicates that the arc from F to E is used. c) If there is a fixed cost for visiting each node, modify the formulation of the problem to include said fixed cost in the objective function, and the variables and restrictions that are required.     NODE A B C D E F G FIXED COST 25 18 32 20 28 18 34
4.1.1 Complete solution and answer only no need explanation Given three data points (1,6), (3,28), and (10, 231), What is the value of y at x = 2 if the function y = 2x2 + 3x + 1 passes through the three data points.
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole