Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 84
Page 48
... represented in the excess code . In the table of Figure 1-19 , you will find that each of the traditional binary values exceeds the value being represented in the code by eight . For example , the pattern 1100 represents 12 in the ...
... represented in the excess code . In the table of Figure 1-19 , you will find that each of the traditional binary values exceeds the value being represented in the code by eight . For example , the pattern 1100 represents 12 in the ...
Page 50
... represented is negative . Thus , we negate the pattern by complementing it to get 0101 and then increment it to get 0110. This result is the binary representation of 6 ; we conclude that the original two's complement pattern 1010 represents ...
... represented is negative . Thus , we negate the pattern by complementing it to get 0101 and then increment it to get 0110. This result is the binary representation of 6 ; we conclude that the original two's complement pattern 1010 represents ...
Page 57
... represents the larger value . When using the floating - point format discussed in the text , what is the largest value that can be represented ? What is the smallest positive value that can be represented ? a . 23/4 c . 3/4 e . 3 . 4 ...
... represents the larger value . When using the floating - point format discussed in the text , what is the largest value that can be represented ? What is the smallest positive value that can be represented ? a . 23/4 c . 3/4 e . 3 . 4 ...
Contents
Introduction | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
activities actually addition algorithm allow appear application approach assign associated begin binary block called cell Chapter characters collection communication complete consider consists contains contents database described devices discussed employee entry example execution expressed fact field Figure function given identified implemented indicated input insertion instruction involved language linked loop machine machine's major means memory memory cells module move node notation Note object obtain operating system organization original particular pattern perform pivot pointer position problem produce record refers relation represented request result retrieve routine sequence sequential single solution solving sort stack statement step storage stored string structure subprogram Suppose tape task technique terminal translator tree unit write