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.11, Problem 3.51PP
Explanation of Solution
Table for code sequences:
- The details of table are shown below:
| Tx | Ty | Instructions |
| long | double | vcvtsi2sdq %rdi, %xmm0, %xmm0 |
| double | int | vcvttsd2si %xmm0, %eax |
| float | double |
vunpcklpd %xmm0, %xmm0, %xmm0 vcvtpd2ps %xmm0, %xmm0 |
| long | float | vcvtsi2ssq %rdi, %xmm0, %xmm0 |
| float | long | vcvttss2siq %xmm0, %rax |
Explanation:
- The argument “x” is either in “%xmm0” or in named portion of register “%rdi”.
- The assembly instructions are used to perform type conversion and to copy value to named portion of register “%rax”...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
[1] (
Show your work. Show hoe you compute memory address by using the effective memory
address computation.
Assume the following values are stored at the indicated memory addresses and
registers:
Address Value
0x100
OxFF
0x104
OxAB
0x108
0x13
0x10c
0x11
Register
%rax
%rcx
%rdx
$0x108
(%rax)
4(%rax)
9(%rax, %rdx)
260(%rcx,%rdx)
OxFC (,%rcx, 4)
(%rax, %rdx, 4)
Value
0x100
0x1
0x3
Fill in the following table showing the values for the indicated operands:
Operand
Value
%rax
0x104
The programming language: C++
The union of two ordered lists (Sequential linear list)[the solution
introduction: The first video of in 3.1, 35:00-43:00]
[Problem description]
Give the union of two ordered lists. The maximal number of elements in an
inputted set is 30.
[Basic requirements]
1) Use sequential linear list.
2) The result list should also be ordered.
[Example]
Problem: Give the union of the ordered lists (3,4,9,100,103) and
(7,9,43,53,102,105).
What you need to show in the terminal(the back part is outputted by you
and the blue part is inputted by the user, i.e., teacher):
Please input the first ordered list: (3,4,9,100,103)Please input the second ordered list: (7,9,43,53,102,105)
The union is:
(3,4,7,9,9,43,53,100,102,103,105)
Systems Programming
Purpose: The purpose of this assignment is to practice loop instructions and
array iterations in M6800 assembly language programming.
Write an assembly language program which implements the following C code that
is a find minimum problem solution implementation:
int A[10] = {8, 14, 6, 16, 5, 5, 10, 9, 4, 11};
int i = 0;
int min = 255; // This is the largest number 8-bit accumulators can hold.
while (i < 10) {
if (A[i] < min)
min = A[i];
}
Your solution should be able to handle all possible array elements and orderings
for any value an accumulator can hold.
You should treat variable į as XR in assembler (index register) and store variable
min in the address 60H.
0010: 00 00 00 00 00 00 00 00 0O 00 00 00 00 00 00 00
8628: 00 060 00 00 00 600 00 00 00 08 08 00 6 00 00 00
0030: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0040: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0050: 00 G0 00 00 00 00 00 00 00 00 00 00 00 00 00 00
006 0: 00 00 00 00 00 00 00 00 00 08 00…
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
- (4) [8]Write code for a function multBy3divBy4, that for argument int x, computes 3*x/4, but follows the bit-level integer coding rules (text p.128) like in problem 3 of the assignment 1. (you may assume ints are 32 bits). (Note: The operation in your code 3*x is allowed to cause overflow.)arrow_forward▸ A is an array of 100 words and variables g and hare registers x20 and x21. ▸ Assume the starting (base) address of A is in x22. Use x9 for the temporary register. I > Compile the C statement. The number 8 is also known as the offset. Offset to be added is 32 as each word is 4 bytes. g= h + A[8]: Load word 1w x5, 40(x6) x5- Memory[x6 + 40] Word from memory to registerarrow_forward(Base Indexed Memory Addressing Mode) Only at [{DS | SS | ES}: {SI | DI} + {BX + BP}] BA EA There is a combination between (Base and Index) in Effective Add. (EA) Ex. Described each line and write down the equation of physical add. For the following assembly code: 01 org 100 02 MOV [BX+DI], CL 03 MOV CH, [вх+SI) 04 MOV AH, [BP+DI] 05 MOV [BP+SI], AL 06 retarrow_forward
- 4(c): Design an "unconventional" priority encoder as follows: It has 3 inputs D0, D1 and D2 and outputs A1, A0 and Valid. The input combination [D1,D0] = [11] is guaranteed to never happen, that is, both D1 and DO cannot be 1 at the same time. If D2 is 1, then the output code [A1A0]=[10]. Else it is either [01] or [00] depending on which of D1 or DO is logic 1. If any input is 1, Valid=1, else Valid=0. Give expressions for A1, A0 and Valid in terms of D0, D1 and D2. A1 = AO = Valid = You may DI Do yoo/01 use any lo 00 101 method you know to get your answer. Ai Ao Please draw any k-maps D2 00 01 10 used for partial credit (see below). It must be Valid. clear how you got your answer, i.e. show all "rough" work.arrow_forward1. Assuming the base address of array A is in $X20, and base address of array B is in $X21. Also assume variables i and k are stored in register $X25 and $X26, respectively. What are the corresponding LEGV8 code for the following C code statements? a) A [ 8] = B[ 8] +B[ 2]- 16 b) A [i+ 4] = 4*A[ i] - k c) B[8] = 2*A[i-k]arrow_forward[1] ( Show your work. Show hoe you compute memory address by using the effective memory address computation. Assume the following values are stored at the indicated memory addresses and registers: Address Value 0x100 OxFF 0x104 OxAB 0x108 0x13 0x10c 0x11 $0x108 (Zrax) Fill in the following table showing the values for the indicated operands: Operand Value Zrax 0x104 4(%rax) 9(%rax, Xrdx) Register Zrax Zrcx %rdx 260(Xrcx,Xrdx) OxFC(Zrcx, 4) (Zrax, Xrdx, 4) Value 0x100 0x1 0x3arrow_forward
- (Base Indexed Memory Addressing Mode) Only at [{DS | sS | ES} : {SI | DI} + {BX + BP}] BA EA There is a combination between (Base and Index) in Effective Add. (EA) Ex. Described each line and write down the equation of physical add. For the following assembly code: 01 org 100 02 MOV [BX+DI], CL оз мOV CH, [BX+SI] 04 MOV AH, [BP+DI] 05 MOV [BP+SI], AL 06 ret Sol:arrow_forward02: (a) What is recursive function in C++ language give an example? (b) Detect the four errors in the following C+t program: #include void main ) ( int ip, x; int arr[6]=[ 10, 34, 13, 76, 5, 46 ]; ip = *arr[01: for (x 0; x < 6; x++) { cout << ip; %3D (*ip)++:arrow_forwardQuestion 3 (a) Provide a single line of C++ code that will declare an integer pointer variable named x. (b) You have variable c declared as int c; Give the single line of C++ code that will assign the integer that is pointed to by x (from above) to c. (c) Now provide the C++ code that will assign the address of c to x. (d) You may assume that x is now pointing to an allocated and initialised block of 10 integers. Write a for loop that uses pointer arithmetic to print out the contents of this block. (e) What is a segmentation fault?arrow_forward
- 12. (identities). Minimize the function F using algebraic modifications (w,x,y,z) Y(Z+WX (W+Z)) + (XY+(x+y) + Z) + z ((ZX +2X) A M+1) = 12²x²x²m)_]arrow_forwardSea t (k) a function that denotes the number of times that the instruction sum + = i + j will be executed in the code that follows. k is assumed to be a positive integer. Find the exact formula for t (k). Find a simple function A (k) such that t (k) = Θ (A (k)). Justify the answer with the corresponding theorems. (Note: you are not asking what the value is end of the sum variable)arrow_forwardExample 7: Code the below problem using C++ Sample Input: 1. 4 1234 Sample Output: 16 Ayush has an array a of n integers. He wants to collapse the entire array into a single element. To do this, he can perform the operation described below any number of times. Each operation grants some points, and Ayush's total score will be the sum of the points granted over all operations he performs. Let aſi..j] denote the subarray of a starting at index i and ending at j. Define min; j to be the minimum value in a[i..j]. In one operation he can do the following: • Select any subarray a[i. j] of a of size at least 2 and replace this subarray by a single element equal to the sum of elements of the subarray. The number of points granted by such an operation, which will be added to his total score, is (j – i+1) · min;j. For example, consider an array a = [2, 3, 5]. If he selects the subarray a[1..2], his total score increases by 2 · 2 = 4 points. Now a = [5, 5]. Ayush performs operations until only a…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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