## Computer Science: An Overview |

### From inside the book

Results 1-3 of 33

Page 168

Admittedly, this does not sound like much, but the fact is that we are almost done

from the

name just positioned had been

the ...

Admittedly, this does not sound like much, but the fact is that we are almost done

from the

**algorithm**point of view. If the portions of the list above and below thename just positioned had been

**sorted**, the entire list would now be**sorted**. Thus,the ...

Page 181

Design a recursive version of the Euclidean algorithm (question 3 of Section 4-2).

16. Suppose we applied both testl and ... Redesign the quick

the last name in the list as the pivot entry. 20. The factorial of 0 is defined to be ...

Design a recursive version of the Euclidean algorithm (question 3 of Section 4-2).

16. Suppose we applied both testl and ... Redesign the quick

**sort algorithm**usingthe last name in the list as the pivot entry. 20. The factorial of 0 is defined to be ...

Page 432

We see, then, that any constant coefficient involved in the computation of the

complexity of an algorithm is more likely to ... Suppose we found that a machine

programmed with our insertion

to ...

We see, then, that any constant coefficient involved in the computation of the

complexity of an algorithm is more likely to ... Suppose we found that a machine

programmed with our insertion

**sort algorithm**required an average of one secondto ...

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

PART ONE Machine Architecture | 19 |

Data Manipulation | 62 |

Copyright | |

11 other sections not shown

### Other editions - View all

### Common terms and phrases

activities actually algorithm Alice application application software ASCII assign binary bit patterns block bulk storage byte called Carol Chapter COBOL computer science concept consider consists contains current entry data control block database described devices diagram disk employee example execution Figure floating-point FORTRAN goal hash head pointer hexadecimal identified implemented input insertion sort instruction integer key field linked list loop machine language machine's main memory memory cells modified module move node operating system parity bit password perform pivot entry polynomial position problem produce program counter programming languages pseudocode Questions/Exercises queue record relation represented request result retrieve routine search tree Section segment sequence sequential file solution solving sort algorithm stack statement step stored string structure subprogram syntax tape target value task technique terminal translator Turing machine