## Computer Science: An Overview |

### From inside the book

Results 1-3 of 47

Page 54

We divide the remaining 7 bits of the byte into two groups, or

exponent

exponent

We divide the remaining 7 bits of the byte into two groups, or

**fields**, called theexponent

**field**and the mantissa**field**. Let us designate the next three bits as theexponent

**field**and the remaining four bits as the mantissa**field**. The byte is ...Page 55

and move the radix one bit to the left since the exponent

negative 1. We therefore have: .01.100 which represents */s. Since the sign bit in

the original pattern is 1, the value stored is negative. We conclude that the ...

and move the radix one bit to the left since the exponent

**field**(011) represents anegative 1. We therefore have: .01.100 which represents */s. Since the sign bit in

the original pattern is 1, the value stored is negative. We conclude that the ...

Page 310

Copy the value in the pointer

NEW ENTRY. 2. Change the value in the pointer

the address of NEW ENTRY. Routine 2 1. Change the value in the pointer

...

Copy the value in the pointer

**field**of PREVIOUS ENTRY into the pointer**field**ofNEW ENTRY. 2. Change the value in the pointer

**field**of PREVIOUS ENTRY tothe address of NEW ENTRY. Routine 2 1. Change the value in the pointer

**field**of...

### What people are saying - Write a review

User Review - Flag as inappropriate

sa

### Contents

Introduction | 5 |

PART ONE Machine Architecture | 19 |

Data Manipulation | 61 |

Copyright | |

12 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 condition consider consists contains contents correct current entry database described devices discussed employee entry example execution expressed fact field Figure function given identifier implemented insertion instruction involved language linked loop machine major means memory memory cell module move node notation Note object obtained operating system original particular pattern perform pivot pointer position problem produce record refers relation represented request resource result retrieve routine sequence sequential single solution solving sort stack statement step storage stored structure subprogram success Suppose tape task technique termination tree unit write