intro textbooks . com

This introductory textbook presents the concepts, methods, and results that are fundamental to the science of computing. Algorithmics begins with the basic ideas of algorithms such as the structure and the methods of data manipulation, and then moves on to demonstrate how to design an accurate and efficient algorithm. Inherent limitations to algorithmic design are also discussed throughout the second part of the text. This introductory textbook is for anyone interested in being introduced to the theory of 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