Algorithms & Data Structures: The Science Of Computing (Electrical and Computer Engineering Series) - Softcover

Baldwin, Douglas; Scragg, Greg

Softcover

ISBN 10: 1584502509 ISBN 13: 9781584502500

Publisher: Charles River Media, 2004

Synopsis

While many computer science textbooks are confined to teaching programming code and languages, Algorithms and Data Structures: The Science of Computing takes a step back to introduce and explore algorithms -- the content of the code. Focusing on three core topics: design (the architecture of algorithms), theory (mathematical modeling and analysis), and the scientific method (experimental confirmation of theoretical results), the book helps students see that computer science is about problem solving, not simply the memorization and recitation of languages. Unlike many other texts, the methods of inquiry are explained in an integrated manner so students can see explicitly how they interact. Recursion and object oriented programming are emphasized as the main control structure and abstraction mechanism, respectively, in algorithm design. Designed for the CS2 course, the book includes text exercises and has laboratory exercises at the supplemental Web site.

About this title

About the Author

Douglas Baldwin (Honeoye Falls, NY) is an Associate Professor of Computer Science at SUNY Geneseo. A graduate of Yale University, he has taught courses from CS1 to Compiler Construction, and from Networking to Theory of Programming Languages. He has authored many journal articles and conference papers within the field.

Review

Preface PART I THE SCIENCE OF COMPUTING"S THREE METHODS OF INQUIRY Chapter 1 What is the Science of Computing? Chapter 2 Abstraction: An Introduction to Design Chapter 3 Proof: An Introduction to Theory Chapter 4 Experimentation: An Introduction to the Scientific Method PART II PROGRAM DESIGN Chapter 5 Conditionals Chapter 6 Designing with Recursion Chapter 7 Analysis of Recursion Chapter 8 Creating Correct Iterative Algorithms Chapter 9 Iteration and Efficiency Chapter 10 Case Study in Design and Analysis: Efficient Sorting PART III INTRODUCTION TO DATA STRUCTURES Chapter 11 Lists Chapter 12 Queues and Stacks Chapter 13 Binary Trees Chapter 14 Case Studies in Design: Abstracting Indirection PART IV THE LIMITS OF COMPUTER SCIENCE Chapter 15 Exponential Growth Chapter 16 Limits to Performance Chapter 17 The Halting Problem Appendix A Object-oriented Programming in Java Appendix B About the Web Site Index

Edition details

• Publisher: Charles River Media
• Publication date: 2004
• ISBN 10: 1584502509
• ISBN 13: 9781584502500
• Binding: Paperback
• Language: English
• Edition number: 1
• Number of pages: 620