## Computer Science: An Overview |

### From inside the book

Results 1-3 of 38

Page 40

A popular and extremely simple method of detecting errors is based on the

principle that if each of the

Is and a pattern is found with an even number of Is, an error must have occurred.

A popular and extremely simple method of detecting errors is based on the

principle that if each of the

**bit patterns**being manipulated has an odd number ofIs and a pattern is found with an even number of Is, an error must have occurred.

Page 47

When searching for an efficient technique for representing whole numbers as

there is often a need to store negative values as well as positive ones. Thus, we ...

When searching for an efficient technique for representing whole numbers as

**bit****patterns**, we might try the binary notation presented in Section 1-5, except thatthere is often a need to store negative values as well as positive ones. Thus, we ...

Page 50

For example, starting with the value 5, we can obtain the pattern for - 5 by

complementing 0101 (the representation for 5) to get 1010 ... Nonnegative values

are represented by the

representations.

For example, starting with the value 5, we can obtain the pattern for - 5 by

complementing 0101 (the representation for 5) to get 1010 ... Nonnegative values

are represented by the

**bit pattern**that corresponds to their base tworepresentations.

### What people are saying - Write a review

User Review - Flag as inappropriate

sa

### Contents

Contents | 1 |

PART ONE Machine Architecture | 19 |

Data Manipulation | 61 |

Copyright | |

8 other sections not shown

### Other editions - View all

### Common terms and phrases

abstract data type activities actually addition algorithm application application software array ASCII assign binary bit patterns block bulk storage byte called Chapter COBOL concept consider consists contains current entry Current Pointer data types database declare search deleted devices diagram discussed disk employee example execution Figure goal hash head pointer hexadecimal identified implemented input insertion sort instruction integer key field linked list loop machine language machine's memory main memory memory cells modified module move notation operating system organization password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue record represented request result retrieve routines search tree Section segment sequence sequential file solution solving sort algorithm stack statement step storage system stored string subprogram syntax tape target value task technique terminal Turing machine two's complement