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.1, Problem 2.5PP
A.
Program Plan Intro
Byte ordering:
- Some machines decide to store the objects in memory ordered from least significant byte to most, while other machines store them from most to least.
- The byte ordering are made by the two ways:
- Little Endian
- In little Endian, the least significant byte comes first.
- Big Endian
- In big Endian, the most significant byte comes first.
- Little Endian
Example:
The example for find the little-endian and big-endian for hexadecimal value is shown below:
Here assume that the hexadecimal value is “0x13244860”. Then address range for given ordering byte is “0x200” through “0x203”.
Big Endian for given hexadecimal value is
| 0x200 | 0x201 | 0x202 | 0x203 |
| 13 | 24 | 48 | 60 |
Little Endian for given hexadecimal value is
| 0x200 | 0x201 | 0x202 | 0x203 |
| 60 | 48 | 24 | 13 |
From the given question, the function definition for “show_bytes” is
void show_bytes(byte_pointer start, size_t len) {
int i;
for (i = 0; i < len; i++)
printf(" %.2x ", start[i]);
printf(“\n”);
}
The function “show_bytes” is used to show the address of a sequence of bytes indicated a byte pointer and a byte length.
B.
Program Plan Intro
Byte ordering:
- Some machines decide to store the objects in memory ordered from least significant byte to most, while other machines store them from most to least.
- The byte ordering are made by the two ways:
- Little Endian
- In little Endian, the least significant byte comes first.
- Big Endian
- In big Endian, the most significant byte comes first.
- Little Endian
Example:
The example for find the little-endian and big-endian for hexadecimal value is shown below:
Here assume that the hexadecimal value is “0x13244860”. Then address range for given ordering byte is “0x200” through “0x203”.
Big Endian for given hexadecimal value is
| 0x200 | 0x201 | 0x202 | 0x203 |
| 13 | 24 | 48 | 60 |
Little Endian for given hexadecimal value is
| 0x200 | 0x201 | 0x202 | 0x203 |
| 60 | 48 | 24 | 13 |
From the given question, the function definition for “show_bytes” is
void show_bytes(byte_pointer start, size_t len) {
int i;
for (i = 0; i < len; i++)
printf(" %.2x ", start[i]);
printf(“\n”);
}
The function “show_bytes” is used to show the address of a sequence of bytes indicated a byte pointer and a byte length.
C.
Program Plan Intro
Byte ordering:
- Some machines decide to store the objects in memory ordered from least significant byte to most, while other machines store them from most to least.
- The byte ordering are made by the two ways:
- Little Endian
- In little Endian, the least significant byte comes first.
- Big Endian
- In big Endian, the most significant byte comes first.
- Little Endian
Example:
The example for find the little-endian and big-endian for hexadecimal value is shown below:
Here assume that the hexadecimal value is “0x13244860”. Then address range for given ordering byte is “0x200” through “0x203”.
Big Endian for given hexadecimal value is
| 0x200 | 0x201 | 0x202 | 0x203 |
| 13 | 24 | 48 | 60 |
Little Endian for given hexadecimal value is
| 0x200 | 0x201 | 0x202 | 0x203 |
| 60 | 48 | 24 | 13 |
From the given question, the function definition for “show_bytes” is
void show_bytes(byte_pointer start, size_t len) {
int i;
for (i = 0; i < len; i++)
printf(" %.2x ", start[i]);
printf(“\n”);
}
The function “show_bytes” is used to show the address of a sequence of bytes indicated a byte pointer and a byte length.
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)
(c) An electronic rainfall depth measurement device is developed to collect the data from
the past 7 days as shown in Table 1 to study the weather condition at UniMAP.
Table 1
[Jadual 1]
Location: UniMAP
Day Rainfall Depth (mm)
5.9
1
2
6.7
3
2.4
7.8
5.2
4
5
1.8
7
3.5
(i) Write a program in C to receive the values of rainfall depth and display the
number of days with light rain ( 7.6 mm) from the
record in Table 1.
(ii) Rewrite the program in (c)(i) to identify and display the day with the lowest value
of rainfall depth, the day with the highest value of rainfall depth and the average
value of rainfall depth for the past 7 days.
Design by C++
Using subroutines (VOID) write a program to perform numerical integration of
f(x)=x^2*sin(x)*exp(x^2) over x=[0,Pi] having a choice of
(i) rectangular rule
(ii) the Simpson’s rule
Divide the domain into N subsections, where N=5,10,20,40. Compare your results.
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
- Question 2 Using the incomplete programming code given, complete the code using dynamic programming with memory function, to reproduce the results in the following Table 1. (C++) #include<iostream>using namespace std; // max knapsack capacity // *** WRITE YOUR CODE HERE ***// num of items // *** WRITE YOUR CODE HERE ***// weight of each item // *** WRITE YOUR CODE HERE ***// value of each item // *** WRITE YOUR CODE HERE ***// variable for dynamic programming matrix // *** WRITE YOUR CODE HERE *** //==========================================// Dynamic programming function: recursive// ========================================= // ALGORITHM F(i,j) // int value // if F[i,j] is not filled yet (-1): // (start with j = W, i = n) // if capacity j < current item's weight w[i]: // value = recall F(i-1, j) // else: // we can include current item,…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_forwardQUESTION 2 The following C code is used to calculate the magnitude across a capacitor and corresponding phase angle in a series RC circuit. void main (void) { float f_start, f_end, f_step, f, r, c, Magnitude, Angle; GetValues (&f_start, &f_end, &f_step, &r. &c ) for (f=f_start; farrow_forward12. (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_forwardProblem (5) Consider the code in main() below. Write code (in C++) to close as many memory leaks as possible. If there is still some memory leaking, describe why you cannot take care of it. int** pp; int* p1, p2; int x = 2; p2=new int; pp=new int*; *pp = p2; = new int; %3D p2 **pp = p1 *p2; *pp; p2 = new int;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_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_forwardProblem 17. [ 1 point for correctness ] Use the Design Recipe to define a function pulse_rate that has two parameters. The first is the number of seconds a nurse has counted pulses, and the second is the number of pulses counted (both ints). The function should return the pulse rate, pulses/minute, as a float. Don't forget to convert seconds to minutes! Include a Docstring.(use Python) For example: Test Result print(round(pulse_rate(30,22),1)) 44.0 Use this statement to test your pulse_rate function: assert_equal(round(pulse_rate(30, 22),1),44.0)arrow_forwardQ1) Consider a simple traffic light system to regulate safe pedestrian crossing on a busy lane. Consider the following system requirement:(SysReq:)The traffic lights shall allow pedestrians to safely cross the lane by stopping cars together with the following software requirements: (SofReq1:)The light switch for pedestrians will be set to 'green' within x seconds after the pedestrian button has been pressed. (SofReq2:)The light switch for cars will be set to 'red' at least y seconds before the light switch for pedestrians is set to 'green'. Find missing environment assumptions and domain properties that are necessary to build the following satisfaction argument: {SofReq1, SofReq2, assumptions?, domain properties?} =SysReq Are the missing domain properties adequate? Are the missing assumptions realistic?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 3) One of the automatic memory deallocations is based on scope of a variable stored in a memory. Give a Java/etc code in which variable will be deallocated when scope of the variable is over. Explain in your example when the variable is stored in the memory and when it is deallocated.arrow_forwardPROBLEM 1 ( Make a diagram of memory for point one. int add(const int *p, const int *q) { int r = *p; //---------- point one return r + *q; } int pass(const int *a, const int *b) { return add(a, b); } int main(void) { int x = 22, y = 33, z; z = pass (&x, &y); return 0; }arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr