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 2.4, Problem 2.46PP
A.
Explanation of Solution
Calculation of binary representation:
- From the given question, the binary value of “1/10” is represented by “0.000110011[0011]…….2”.
- The portion of given brackets denotes the value “0011” repeated indefinitely.
- Consider the value of “0.1” is first “23” bits of the sequence of the binary points.
- That is “23” bits from “0.000110011[0011]…….2” is “0.00011001100110011001100”.
- It is assumed as the “x” value.
- Now computing the value of “0.1 – x” is shown below:
- The binary value of “0.1” is “0.00011001100110011001100”.
- The binary value of “x” is “0.00011001100110011001100”.
- Determining the value of “0.1 – x” means.
- The value of “x” is in negative. So, need to take 2’s complement
Binary value of “x”: 0.00011001100110011001100
1’s complement: 1...
- The value of “x” is in negative. So, need to take 2’s complement
B.
Explanation of Solution
Calculation of decimal representation:
- From the given question, the binary value of “1/10” is represented by “0.000110011[0011]…….2”.
- The portion of given brackets denotes the value “0011” repeated indefinitely.
- Consider the value of “0.1” is first “23” bits of the sequence of the binary points.
- That is “23” bits from “0.000110011[0011]…….2” is “0.00011001100110011001100”.
- It is assumed as the “x” value...
C.
Explanation of Solution
Time calculation of difference between the actual time and the time computed by the software:
From the given question, the system had been running for around “100” hours. So, from the part B, the time computed by the software is “
In general, 1 hour =
From the given question, the counter is increment at “0
D.
Explanation of Solution
Calculation of prediction:
From the given question, a Scud travels at around 2,000 meters per second.
From the part C, the time is “0.343” seconds...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
no. 6 needed please ?
Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.”
And answer the following questions:
Question:The Ricart& Argwala mutual exclusion algorithm:
(a) Does not depend on time stamps in messages while Lamport's does.
(b) Cannot handle the case where two or more processes request the same resource at the same
time.
(c) Does not require a process to send messages to the entire group while Lamport's does.
(d) Requires fewer messages than Lamport's algorithm.
) The number of unneeded printouts is growing eve:yyear. This practice wastes paper, electricity, storage space, and natural resources. It also contributes to pollution and landfill use. If you could do one thing to reduce the practice ofunnecessary printing, what would it be? Would you restrict paper use In offices? Would you ration paper? Would you take printers away from certain types of workers? Would you forbid the printing ofcertain types of documents (such as e-mail messages)? Are such radical actions needed? If you do not agree. what types ofactions would you support
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
- C/Users/Khaydhison/Documents/SAD/Architecture%20Take%20Home%20Exam.pdf (L Page view A Read aloud Draw F Highlight Erase on 3 a. As a computer manufacturer you are faced with the challenge of designing quality machines with very excellent processing speed, which should also be affordable to all. Discuss a mechanism you would employ to produce a high-quality machine with good speed but at an affordable cost. b. Use the Fetch Decode Execution steps to execute the assembly language into machine instructions and execute the instruction as the computer would. Explain into detail what happens during the execution of each statement. %#3 Machine code 0. 001 1 111100 1 010 0 110000 10:21 PM Ps 4/16/2021 hparrow_forwardpython help.... Write (and evaluate) Python expressions that answer the below questions regarding alist lst of scores of 15 deliverables:[94, 86, 85, 81, 86, 96, 91, 85, 86, 83, 89, 81, 86, 98, 84]a. What are the lowest, highest, and average score?b. What is the median score?c. What is the range of the scores?d. How many of the scores are 85?arrow_forwardMay I have some help with this problem please?arrow_forward
- Generate MIPS code for the following code segments assuming that all variables are in memory locations. please solve with clear steps not handwritten if possiblearrow_forwardMay you check my work? Is it correct?arrow_forwardOperating System: Consider a demand-paging system with a paging disk. The average disk access time is 10 milliseconds, and the average memory access time is 100 nanoseconds. Assume 0.1 percent of the access causes page faults. What is the effective memory access time? In order to achieve no more than 5 percent overhead due to demand paging for this system, what should the maximum page fault rate be?arrow_forward
- I am stuck on this problem.arrow_forwardAssume that a program will experience 200 failures in infinite time. It has now experienced 100. The initial failure intensity was 20 failures/CPU hr.(i) Determine the current failure intensity.(ii) Find the decrement of failure intensity per failure.(iii) Calculate the failures experienced and failure intensity after 20 and 100 CPU hrs. of execution.(iv) Compute additional failures and additional execution time required to reach the failure intensity objective of 5 failures/CPU hr. Use the basic execution time model for the above-mentioned calculations.arrow_forwarda) Assume, paging has been used as memory management technique and the page table is stored in memory which takes 150 nanoseconds. In addition, the associative memory is also used which takes 50 nanoseconds. What is the effective memory reference time, If 50% of all page-table references are found in the associative memory?arrow_forward
- Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.” And answer the following questions: Question12: Which disk schedualing algorithm is most vulnerable to starvation (a) SCAN. (b) Shortest Seek Time First (SSTF). (c) LOOK. (d) First Come, First Served (FCFS)arrow_forward5. Identify all data hazards that are present in the following piece of code: Label: Idw r8, 0(r10) ; load into r8 from MEM[0+r10] add r9, r8, r7; r9 = r8 + r7 addi r10, r10, 4; r10 = r10 + 4 addi r12, r12, 4; r12 = r12 + 4 %3D sub r8, r13, r14; r8 = r13 – r14 bne r10, r11, Label; branch to Label if r10 != r11 stw r9, -4(r12); store r9 into MEM[-4+r12]arrow_forwardAssume the memory contains 6 holes with the sizes of 190, 550, 220, 420, 650, and 110 A sequence of requests for 4 blocks is to be satisifed: A = 210, B = 430, C = 100, D = 420. The following table has two rows for each of the four memory allocation strategies (first fit, next fit, best fit, worst fit). Fill in the table as follows: Block Allocated: Enter the letter of the memory block that will be placed in the indicated hole. If more than one block is allocated in a hole, include both blocks with no spaces (e.g. "DG"). If no block is allocated in a hile, enter "-". • Remaining Size: Enter the size of the remaining hole after all four memory blocks are placed. H1: 190 H2: 550 H3: 220 H4: 420 H5: 650 H6: 110 Block First Fit Blank 1 Blank 2 Blank 3 Blank 4 Blank 5 Blank 6 Allocated Remaining Blank 7 Blank 8 Blank 9 Blank 10 Blank 11 Blank 12 Size Block Next Fit Blank 13 Blank 14 Blank 15 Blank 16 Blank 17 Blank 18 Allocated Remaining Blank 19 Blank 20 Blank 21 Blank 22 Blank 23 Blank 24…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Fundamentals of Information SystemsComputer ScienceISBN:9781337097536Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:9781337097536
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning