## Computer Science: An Overview |

### From inside the book

Results 1-3 of 48

Page 47

When searching for an efficient technique for representing whole numbers as bit

patterns, we might try the binary

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 49

Figure 1-20 A two's complement

be used to represent 0 rather than its usual value of 16. Likewise, you may wish

to confirm (by making a table) that the 3-bit excess system would be known as ...

Figure 1-20 A two's complement

**notation**using bit patterns of length four wouldbe used to represent 0 rather than its usual value of 16. Likewise, you may wish

to confirm (by making a table) that the 3-bit excess system would be known as ...

Page 53

Can the value 9 be represented in excess eight

representing 6 in excess four

the following two's complement representations to its equivalent decimal form: a.

00011 b.

Can the value 9 be represented in excess eight

**notation**? What aboutrepresenting 6 in excess four

**notation**? Explain your answer. 7. Convert each ofthe following two's complement representations to its equivalent decimal form: a.

00011 b.

### 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