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 6, Problem 6.22HW
Program Plan Intro
Given Information:
A rotating disk in which number of bits per track is constant is given.
Expert Solution & Answer
Explanation of Solution
Capacity of disk:
It is given that there is a rotating disk whose number of bits per track is constant. It is assumed that:
“r” denotes the radius of the platter and “
- In a rotating disk, the number of bits per track will remain same which depends on the circumference of the innermost track.
- The most inner track can also be considered as a hole and the number of bits per track will increase if the hole is large and vice versa.
Hence, according to the given information:
“r” denotes the radius of the platter and “
In a rotating disk, the radius of platter is greater than the radius of the hole which can be written as below:
Hence, the value of x should be less than 1 in order to maximize the capacity of the disk and the value of x ranges from “
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
Converting an image to grayscale simplifies the algorithm and reduces computational requirements prior to extracting the image features.
he total bits per pixel (bpp) for this image is 24. This is because for each primary colour (red, green, and blue) there are 8 bits per primary colour, and since there are 3 primary colours, 8 bits x 3 primary colours = 24 bpp.
To calculate the size of the image file in bytes, we need to multiply the number of pixels (300 x 400 = 120,000 pixels) by the bpp (24 bits).
120,000 pixels x 24 bits = 2,880,000 bits
To convert bits to bytes, divide the number of bits by 8 (2,880,000 bits / 8 = 360,000 bytes).
Therefore, the size of the image file in bytes is 360,000.
If the digital image above is converted to grayscale with 8 bpp, calculate the size of this grayscale image file in bytes with disregard to the image compression type. Provide a short explanation on the calculation.
To solve the Hanoi Towers problem, run the following program in image 1 with using the recursive programming method step by step for n = 4 disks and draw the image on the memory like image 2 (image 2 to for n = 3).
Write a program to multiply the contents of the PINB by the contents of the RAM location 0x600 and store the lower and the higher bytes of the result in the RAM locations 0x500 and 0x501 simultaneously
LDI R16, blank
blank DDRB, R16
blank blank , PINB
blank R16, blank
blank R10, R16
blank 0x500, blank
blank 0x501,
Chapter 6 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 6.1 - Prob. 6.1PPCh. 6.1 - Prob. 6.2PPCh. 6.1 - Prob. 6.3PPCh. 6.1 - Prob. 6.4PPCh. 6.1 - Prob. 6.5PPCh. 6.1 - Prob. 6.6PPCh. 6.2 - Prob. 6.7PPCh. 6.2 - Prob. 6.8PPCh. 6.4 - Prob. 6.9PPCh. 6.4 - Prob. 6.10PP
Ch. 6.4 - Prob. 6.11PPCh. 6.4 - Prob. 6.12PPCh. 6.4 - Prob. 6.13PPCh. 6.4 - Prob. 6.14PPCh. 6.4 - Prob. 6.15PPCh. 6.4 - Prob. 6.16PPCh. 6.5 - Prob. 6.17PPCh. 6.5 - Prob. 6.18PPCh. 6.5 - Prob. 6.19PPCh. 6.5 - Prob. 6.20PPCh. 6.6 - Prob. 6.21PPCh. 6 - Prob. 6.22HWCh. 6 - Prob. 6.23HWCh. 6 - Suppose that a 2 MB file consisting of 512-byte...Ch. 6 - The following table gives the parameters for a...Ch. 6 - The following table gives the parameters for a...Ch. 6 - Prob. 6.27HWCh. 6 - This problem concerns the cache in Practice...Ch. 6 - Suppose we have a system with the following...Ch. 6 - Suppose we have a system with following...Ch. 6 - Suppose that a program using the cache in Problem...Ch. 6 - Repeat Problem 6.31 for memory address0x16E8 A....Ch. 6 - Prob. 6.33HWCh. 6 - Prob. 6.34HWCh. 6 - Prob. 6.35HWCh. 6 - Prob. 6.36HWCh. 6 - Prob. 6.37HWCh. 6 - Prob. 6.38HWCh. 6 - Prob. 6.39HWCh. 6 - Given the assumptions in Problem 6.38, determine...Ch. 6 - You are writing a new 3D game that you hope will...Ch. 6 - Prob. 6.42HWCh. 6 - Prob. 6.43HWCh. 6 - Prob. 6.45HWCh. 6 - Prob. 6.46HW
Knowledge Booster
Similar questions
- Consider a program where 95% of the code can be parallelized. If you have aninfinite number of processors, what is the maximum speedup possible accordingto Amdahl's Law?arrow_forwardIn MATLAB, a grey-scale image is stored a a matrix of numbers, all between 0 (black) and 255 (white). Since there are 256 possible values, 8 bits are needed or each pixel, in contrast to a normal integer, which is 64 bits.To save memory, grey-scale images are stored with a special data type, uint8 (unsigned 8-bit integer). In computer terminology, 8 bits = 1 byte. Even at one byte per pixel, a large image can consume a lot of memory. For example, a 1000x1000-pixel image takes 1 million bytes (which is a little less than 1 megabyte, since by convention 1 Mbyte = 2^20 bytes). One technique for reducing the size of an image is quantization - reducing the number of allowable levels from 256 to something smaller. Surprisingly, most images can be quantized by a large factor without losing much information. In this problem, you will quantize a grey-scale image to only 4 levels, so that it could (in principle) be stored as 2 bits per pixel. The template will read in an image file. Your job…arrow_forwardGiven rax = 0x0000000200000100, rbx = 0x0000000000000100, and rcx = 0x0000000000000001,and the following values in memoryaddress -> byte at that address0x0000000000000100 -> 0x010x0000000000000101 -> 0x000x0000000000000102 -> 0x000x0000000000000103 -> 0x000x0000000000000104 -> 0x020x0000000000000105 -> 0x000x0000000000000106 -> 0x000x0000000000000107 -> 0x00what is the new value in %rax after the following operation?subq -0x04(%rbx, %rcx, 4), %raxarrow_forward
- Computer Science Let C be a black circular disk in front of a white background. The circular disk is parallel to the image plane. This disk is projected on the image plane through a pinhole. What is the shape of the disk’s projection on the image plane? [Hint: A circular disk parallel to the image plane is described algebraically as all 3D points [X,Y,Z]T with (X-X0) 2 +(Y-Y0) 2 =R2 , Z=Z0, where [X0,Y0,Z0] T is the center of the disk and R is its radius.]arrow_forwardConnect a 5*7 dot-matrix display to the 8051-microcontroller (Draw the schematic on paper and upload it as a photo). Then, display the content of variable NUMBER on the display, digit by digit every one second. for example if NUMBER=249, then "2" will be displayed for one second, after that digit "4" and finally digit "9" will be displayed for a whole second. Assume that the necessary lookup table exists in Memory at address 0xF000arrow_forwardHow do you say "robotic optical disk library devices" in another language?arrow_forward
- Use the following "sample" set of keys from a disc to demonstrate a balanced three-way merging; the internal memory can retain six keys.12 1 65 7 34 15 90 22 63 56 18 3 9 22 12 88 41arrow_forwardWrite a program for 8051 microcontrollers to copy 20 numbers from location 45 to 64, add 94 with it and paste it to another location from 81 to 100.arrow_forwardConsider the following hexadecimal readout: 000000 8A00 8E00 CFA1 48BF 7900 3202 9015 AD34 000010 0218 6D30 028D 3402 AD35 0288 3102 8D35 000020 0E30 0290 DAEE 3102 4C00 0200 0040 004B Refer to the first byte of memory shown above, address 000000. Assume that this byte is used to store an 8-bit unsigned integer. What is the decimal value stored in this byte? Group of answer choices 138 -27 22,842 66arrow_forward
- Let T (n) be the number of moves in our solution to the n-disc.•move the top n −1 discs from the source to the scratch peg,•move disc n from the source to the destination peg, and•move the top n −1 discs from the scratch to the destination peg.The first step takes T (n −1) moves, the second step takes one move, andthe third step takes T (n −1) moves again. In other words,T (n) = 2T (n −1) + 1.This applies when n > 0. At zero, we have T (0) = 0, because with zerodiscs the start and final states are identical; there are no moves to make.Your task is to find a closed-form expression for T (n) (i.e., one that doesnot use recursion), and prove that it’s correct using induction.arrow_forwardThe variables in the microcontroller RAM memory at the beginning and end of the code below.How do the values change? Explain by drawing. (For variables, any 2 memory addresses between 0 and 2KByou can define.arrow_forwardWorking with cell addresses The address of a cell in Google sheets can be specified in two ways: either as a letter-number pair like C5, or as a pair of numbers like "row 5, column 3". Some formulas may be easier to specify on one way or the other, so it's useful to know how to convert from one form to the other and back. ROW() and COLUMN() take addresses in A1 format and return the number of the row and column respectively. ADDRESS() takes numeric row and column inputs and returns the address in A1 format. It also has an option argument to specify the relativity of the addresses: 1 (the default) returns absolute addresses; 2, 3, and 4 return row absolute, column absolute, and relative addresses respectively. In this chapter you'll be working with Indian butterfly data from Singh and Pandey. Instructions In column H, get the row numbers of the Locality column. In column I, get the column numbers of that column. In column J, convert columns H and I back to addresses in $A$1…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning