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
Question
Chapter 2.3, Problem 2.38PP
Program Plan Intro
LEA instruction:
- The “LEA” instruction is provided to support pointer arithmetic.
- The “C” compiler can perform multiplication by constant factors with “LEA” instruction.
- This instruction can perform computations of the form
- Here, the value of “k” is 0, 1, 2, or 3 and value of “b” is “0” or some other program value.
Unsigned multiplication by a power of “2”:
Consider the variables “x” and “k” with unsigned values “x” and “k” in the range
Then the “C” expression “x<<k” produces the value
Example:
The example for unsigned multiplication by a power of “2’ is shown below:
Consider an expression
That is
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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)
Problem #2: A number is divisible by 11 if the difference of the sum of its digits at odd places and the sum of
ts digits at even places is either 0 or divisible by 11.
For example, for 2547039:
(Sum of digits at odd places) - (Sum of digits at even places) = (9 + 0 +4 + 2) - (3+7+5)=D0
So 2547039 is divisible by Il,
But for 13165648:
(Sum of digits at odd places)- (Sum of digits at even places) = (8+6+6 +3) - (4+5 +1+1)= 12
12 is not divisible by 11 so 13165648 is also not divisible by 11.
Sample run:
Total is: 12
13165648 is not divisible by 11.
Example 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…
Chapter 2 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 2.1 - Practice Problem 2.1 (solution page 143) Perform...Ch. 2.1 - Prob. 2.2PPCh. 2.1 - Prob. 2.3PPCh. 2.1 - Practice Problem 2.4 (solution page 144) Without...Ch. 2.1 - Prob. 2.5PPCh. 2.1 - Prob. 2.6PPCh. 2.1 - Prob. 2.7PPCh. 2.1 - Prob. 2.8PPCh. 2.1 - Practice Problem 2.9 solution page 146 Computers...Ch. 2.1 - Prob. 2.10PP
Ch. 2.1 - Prob. 2.11PPCh. 2.1 - Prob. 2.12PPCh. 2.1 - Prob. 2.13PPCh. 2.1 - Prob. 2.14PPCh. 2.1 - Prob. 2.15PPCh. 2.1 - Prob. 2.16PPCh. 2.2 - Prob. 2.17PPCh. 2.2 - Practice Problem 2.18 (solution page 149) In...Ch. 2.2 - Prob. 2.19PPCh. 2.2 - Prob. 2.20PPCh. 2.2 - Prob. 2.21PPCh. 2.2 - Prob. 2.22PPCh. 2.2 - Prob. 2.23PPCh. 2.2 - Prob. 2.24PPCh. 2.2 - Prob. 2.25PPCh. 2.2 - Practice Problem 2.26 (solution page 151) You are...Ch. 2.3 - Prob. 2.27PPCh. 2.3 - Prob. 2.28PPCh. 2.3 - Prob. 2.29PPCh. 2.3 - Practice Problem 2.30 (solution page 153) Write a...Ch. 2.3 - Prob. 2.31PPCh. 2.3 - Practice Problem 2.32 (solution page 153) You are...Ch. 2.3 - Prob. 2.33PPCh. 2.3 - Prob. 2.34PPCh. 2.3 - Practice Problem 2.35 (solution page 154) You are...Ch. 2.3 - Prob. 2.36PPCh. 2.3 - Practice Problem 2.37 solution page 155 You are...Ch. 2.3 - Prob. 2.38PPCh. 2.3 - Prob. 2.39PPCh. 2.3 - Practice Problem 2.40 (solution page 156) For each...Ch. 2.3 - Prob. 2.41PPCh. 2.3 - Practice Problem 2.42 (solution page 156) Write a...Ch. 2.3 - Practice Problem 2.43 (solution page 157) In the...Ch. 2.3 - Prob. 2.44PPCh. 2.4 - Prob. 2.45PPCh. 2.4 - Prob. 2.46PPCh. 2.4 - Prob. 2.47PPCh. 2.4 - Prob. 2.48PPCh. 2.4 - Prob. 2.49PPCh. 2.4 - Prob. 2.50PPCh. 2.4 - Prob. 2.51PPCh. 2.4 - Prob. 2.52PPCh. 2.4 - Practice Problem 2.53 (solution page 160) Fill in...Ch. 2.4 - Practice Problem 2.54 (solution page 160) Assume...Ch. 2 - Compile and run the sample code that uses...Ch. 2 - Try running the code for show_bytes for different...Ch. 2 - Prob. 2.57HWCh. 2 - Write a procedure is_little_endian that will...Ch. 2 - Prob. 2.59HWCh. 2 - Prob. 2.60HWCh. 2 - Prob. 2.61HWCh. 2 - Write a function int_shifts_are_arithmetic() that...Ch. 2 - Fill in code for the following C functions....Ch. 2 - Write code to implement the following function: /...Ch. 2 - Write code to implement the following function: /...Ch. 2 - Write code to implement the following function: / ...Ch. 2 - You are given the task of writing a procedure...Ch. 2 - Prob. 2.68HWCh. 2 - Write code for a function with the following...Ch. 2 - Write code for the function with the following...Ch. 2 - You just started working for a company that is...Ch. 2 - You are given the task of writing a function that...Ch. 2 - Write code for a function with the following...Ch. 2 - Write a function with the following prototype: /...Ch. 2 - Prob. 2.75HWCh. 2 - The library function calloc has the following...Ch. 2 - Prob. 2.77HWCh. 2 - Write code for a function with the following...Ch. 2 - Prob. 2.79HWCh. 2 - Write code for a function threefourths that, for...Ch. 2 - Prob. 2.81HWCh. 2 - Prob. 2.82HWCh. 2 - Prob. 2.83HWCh. 2 - Prob. 2.84HWCh. 2 - Prob. 2.85HWCh. 2 - Intel-compatible processors also support an...Ch. 2 - Prob. 2.87HWCh. 2 - Prob. 2.88HWCh. 2 - We are running programs on a machine where values...Ch. 2 - You have been assigned the task of writing a C...Ch. 2 - Prob. 2.91HWCh. 2 - Prob. 2.92HWCh. 2 - following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Prob. 2.97HW
Knowledge Booster
Similar questions
- Problem 1 Modify Problem 1.py by adding additional lines of code so that it solves the following problem: Determine whether a given number is even and part of the Fibonacci Sequence. The Fibonacci Sequence is as follows 0, 1, 1, 2, 3, 5, 8, 13... For more information about Fibonacci sequences Click here the sequence is comprised exclusively of positive integers. Hint 1: A positive number, n, is part of the Fibonacci sequence if either (5n^2 + 4) or (5n^2 - 4) is a perfect square. That is, if the square root of either (5n^2 + 4) or (5n^2 - 4) is a whole number, then n is a perfect square, and thus a Fibonacci number. Hint 2: Recall that multiple conditions can be checked in one statement. For example, if (condition 1) and (condition 2) and (condition 3): # do some action If a number is even, positive, and part of the Fibonacci sequence, your code should print "Yes". If any one of these conditions is not met, your code should print "No". If your input is number = 2 or 34 or 144, the…arrow_forwardTask(5): Run the following code and note down the output. Also use real, imag and abs functions to plot real part, imaginary part and magnitude.>> n = [0:5]; x = exp ((2+3j)*n) Task(7): Write a program in Matlab to generate 1.5 s of a 50 Hz Saw tooth Waveform withsample rate fs = 10000 and plot 0.2 s of the generated waveform Task(1): Write a MATLAB code to sum unit step and unit ramp function . subject is signal and system please solve me all three task on matlab give me code and outputarrow_forward(a) Assume that five generation units with third order cost function (F: (P) = A: P²³ + B; P; ² + C; P; +D;) are in the circuit. Write a computer program using any arbitrary programming language (MATLAB, C++, C#, Python,...) to calculate economic. load dispatch (ELD) using first order gradient method. Note that all parameters and variables should be defined inside the program (at first lines) such that units' characteristics and demand can be changed easily. Neglect grid losses.arrow_forward
- Generator - Full code and plotting neweful. Task(5): Run the following code and note down the output. Also use real, imag and abs functions to plot real part, imaginary part and magnitude.>> n = [0:5]; x = exp ((2+3j)*n) Task(7): Write a program in Matlab to generate 1.5 s of a 50 Hz Saw tooth Waveform withsample rate fs = 10000 and plot 0.2 s of the generated waveform Task(1): Write a MATLAB code to sum unit step and unit ramp function . subject is signal and system please solve me all .arrow_forward4(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_forwardProblem 7 [Algorithms integers m and k such that n = m × 24, where m is the smallest integer. For any even integer n, it is always possible to find a pair of 1. Write an algorithm that finds a factorization of any even integer n as stated above. For instance, we have the following two factorizations: 48 = 3 × 24 instead of 48 = 12 × 22 52 = 13 x 22 instead of 52 = 26 × 2. 2. Analyze the time of your algorithm by computing the number of its multiplications. Show your work step by step. Otherwise, your solution is incorrect.arrow_forward
- (Greedy Algorithms) Suppose you are given n tasks j={j1,j2,...jn}.Each task jl has two parts -a preprocessing phase which takes pl unites and a main phase which takes fl units of time. There are n machines that can esecute the main phase of the jobs in parallel. However, the preprocessing phases need to be execute sequentially on a special machine. The completion time of any schedule is the earliest time when all tasks have finished execution. Design a greedy algorithm which produces a schedule the minimizes the completion time. Here, you need to give formal proof of correctnessarrow_forward2. Full code and plotting neweful. Task(5): Run the following code and note down the output. Also use real, imag and abs functions to plot real part, imaginary part and magnitude.>> n = [0:5]; x = exp ((2+3j)*n) Task(7): Write a program in Matlab to generate 1.5 s of a 50 Hz Saw tooth Waveform withsample rate fs = 10000 and plot 0.2 s of the generated waveform Task(1): Write a MATLAB code to sum unit step and unit ramp function . subject is signal and system please solve me all three.arrow_forwardFill in the blanks. Line # Code 1 i-1 2 for (x = 2; xarrow_forward(b) Based on the function below, answer the following question. Assume that helper(n) runs in O(n) time. 1 void problem_2_2_b (int n) { 2 if (n(floor (sqrt (n))) 6 for (int i = 0; i < 281; ++i) { helper (m); 8 for (int j = m; jarrow_forward[C Program] 3. Float Count-off by CodeChum Admin Counting off a list of float numbers is hard when you speak it, but not when you code it! Don't believe me? Then let's try coding just that! Instructions: An array containing 30 predefined float values are already provided for you in the code editor. Print each of the element out in separate lines, starting from the last array element down to the first. Each outputted value must also only show up to two decimal places. Output Multiple lines containing a float number. 2.41 143.00 3.14 3.12 0.00 -321.12 -414.12 12312.10 4.10 2.42 . . . ------------------------------------ #include<stdio.h> int main(void) { float nums[30] = { 1.4, 1.2054, 2.2, 2.5, 3.66, 3.0, 4.024, 4.00001, 5.5, 5.10, 1, 2, 3, 4, 5, -1.11, -1.111, -1.1111, -1.11111, -1.111111, 2.421, 4.1, 12312.1, -414.123, -321.12, 0, 3.123, 3.14, 143, 2.412 }; return 0; } [C Program] [C…arrow_forward[C Program] 3. Float Count-off by CodeChum Admin Counting off a list of float numbers is hard when you speak it, but not when you code it! Don't believe me? Then let's try coding just that! Instructions: An array containing 30 predefined float values are already provided for you in the code editor. Print each of the element out in separate lines, starting from the last array element down to the first. Each outputted value must also only show up to two decimal places. Output Multiple lines containing a float number. 2.41 143.00 3.14 3.12 0.00 -321.12 -414.12 12312.10 4.10 2.42 . . . ---------------------------------- #include<stdio.h> int main(void) { float nums[30] = { 1.4, 1.2054, 2.2, 2.5, 3.66, 3.0, 4.024, 4.00001, 5.5, 5.10, 1, 2, 3, 4, 5, -1.11, -1.111, -1.1111, -1.11111, -1.111111, 2.421, 4.1, 12312.1, -414.123, -321.12, 0, 3.123, 3.14, 143, 2.412 }; return 0; }arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_iosRecommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr