## Computer Science: An OverviewNow in its eighth edition, this book continues to provide a comprehensive, accessible, and up-to-date introduction to the dynamic field of computer science using a breadth-first approach. The table of contents and the text itself have been revised and expanded to reflect changes in the field, including the trend toward using Web and Internet Technology, the evolution of Objects, and the important growth in the field of databases. Specifically, chapter three from the previous edition has been expanded into two chapters. Chapter three will now only cover Operating Systems and the new chapter four will focus on Networks and the Internet. Anyone interested in gaining a thorough introduction to Computer Science. |

### From inside the book

Results 1-3 of 41

Page 198

Modify the sequential search procedure in Figure 5.6 to allow for lists that are not

sorted. 2. Convert the pseudocode routine Z <- 0; ... A variation of the insertion

...

Modify the sequential search procedure in Figure 5.6 to allow for lists that are not

sorted. 2. Convert the pseudocode routine Z <- 0; ... A variation of the insertion

**sort algorithm**is the selection sort. It begins by selecting the smallest entry in the...

Page 208

We conclude that the choice between the sequential search algorithm and the

binary search algorithm would have a significant impact in this ... Let us analyze

the insertion

We conclude that the choice between the sequential search algorithm and the

binary search algorithm would have a significant impact in this ... Let us analyze

the insertion

**sort algorithm**(summarized in Figure 5.11) in a similar manner.Page 209

The significance of these results is that the number of comparisons made during

the execution of the insertion

of time required to execute the algorithm. Using this approximation, Figure 5.19 ...

The significance of these results is that the number of comparisons made during

the execution of the insertion

**sort algorithm**gives an approximation of the amountof time required to execute the algorithm. Using this approximation, Figure 5.19 ...

### What people are saying - Write a review

#### LibraryThing Review

User Review - readafew - LibraryThingThis book was assigned reading for the opening class to my MSIT. I found it a great refresher for a large part of my original CS degree. It is well put together and fairly easy to read. Lots of useful ... Read full review

#### LibraryThing Review

User Review - geekcowboy - LibraryThingGreat book to introduce the theory and practical concepts of computer science. Read full review

### Contents

Introduction | 1 |

Data Abstractions 319 | 12 |

Data Storage | 17 |

Copyright | |

13 other sections not shown

### Other editions - View all

### Common terms and phrases

activities algorithm allow application application software Apply the procedure approach ASCII assigned associated binary search algorithm bit patterns byte called cell at address Chapter components computer science consider consists contains data type database declarative digits disk document employee encoded entry example executed Figure floating-point function goal hexadecimal identify implemented input insertion sort instruction integer Internet layer loop machine language machine's main memory mass storage memory cell node object object-oriented obtain op-code operating system output paradigm parameters parity bit particular perform pointer problem produce program counter programming languages protocol pseudocode QuestionslExercises record representation represented request result retrieve Section sequence sequential server solution solve sort sort algorithm stack statement steps stored string structure Suppose symbol TargetValue task techniques termination TestEntry tion transfer tree two's complement notation variable