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.
Rezensionen / Stimmen
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
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Maße
Höhe: 234 mm
Breite: 187 mm
Dicke: 30 mm
Gewicht
ISBN-13
978-1-58450-250-0 (9781584502500)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
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. Greg Scragg is Professor Emeritus from SUNY Geneseo with over thirty years experience in computer science. Since his graduation from the University of California, he has received several grants related to computer science education and has written over 60 articles for computer science journals.
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