About the Book
The best selling 'Algorithmics' presents
the most important, concepts, methods and results that are fundamental
to the science of computing. It starts by introducing the basic ideas
of algorithms, including their structures and methods of data manipulation.
It then goes on to demonstrate how to design accurate and efficient algorithms,
and discusses their inherent limitations. As the author himself says
in the preface to the book;
'This book attempts to present a readable
account of some of the most important and basic topics of computer science,
stressing the fundamental and robust nature of the science in a form that
is virtually independent of the details of specific computers, languages
and formalisms'.
Features
-
Whole text thoroughly updated to include material
on the object-oriented paradigm, such as classes and instances, inheritance
and abstract data types
-
Contains two new chapters; one discussing
modern and exciting approaches to computation, such as quantum and molecular
computing, genetic algorithms and neural networks, the second covering
system development and software engineering
-
Chapter 3 (Programming Languages) has been
updated with referneces to Pascal, Snobol, and APL being replaced by discussion
of C++ and Java.
Related
Books
Computer Fluency, Literacy & Introduction
to Computer Science (Computer
Science)
Table of Contents
Preface
Acknowledgments
PART I. PRELIMINARIES
1. Introduction And Historical Review
or, What's It All About?
2. Algorithms And Data or, Getting
It Done
3. Programming Languages and Paradigms
or, Getting It Done by Computer
PART II. METHODS AND ANALYSIS
4. Algorithmic Methods or, Getting
It Done Methodically
5. The Correctness of Algorithms or,
Getting It Done Right
6. The Efficiency of Algorithms or,
Getting It Done Cheaply
PART III. LIMITATIONS AND ROBUSTNESS
7. Inefficiency and Intractability
or, You Can't Always Get It Done Cheaply
8. Noncomputability and Undecidability
or, Sometimes You Can't Get It Done At All!
9. Algorithmic Universality and Its
Robustness or, The Simplest Machines That Get It Done
PART IV. RELAXING THE RULES
10. Parallelism, Concurrency and Alternative
Models or, Getting Lots Of Stuff Done at Once
11. Probabilistic Algorithms or, Getting
It Done by Tossing Coins
12. Cryptography and Reliable Interaction
or, Getting It Done in Secret
PART V. THE BIGGER PICTURE
13. Software Engineering or, Getting
It Done When It's Large
14. Reactive Systems or, Getting It
to Behave Properly Over Time
15. Algorithmics And Intelligence
or, Are They Better at It Than Us?
Postscript
Selected Solutions
Bibliographic Notes
Index |
