Algorithms and Data Structures

The Science of Computing

Douglas L. Baldwin, Greg W. Scragg - Collection Computer engineering series

620 pages, parution le 13/07/2004

Ajouter à une liste

Indisponible

Résumé

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.

Features

Reflects the principle that computer science is not solely about learning how to speak in a programming language
Covers recursion, binary trees, stacks, queues, hash tables, and object-oriented algorithms
Written especially for CS2 students
Accompanying Web site includes lab exercises, code, and instructor's notes

L'auteur - Douglas L. Baldwin

Douglas L. 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.

L'auteur - Greg W. Scragg

Greg W. Scragg (Dummerston, VT) 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.

Sommaire

Part I The Science of Computing's Three Methods of Inquiry
- What is the Science of Computing?
- Abstraction: An Introduction to Design
- Proof: An Introduction to Theory
- Experimentation: An Introduction to the Scientific Method
Part II Program Design
- Conditionals
- Designing with Recursion
- Analysis of Recursion
- Creating Correct Iterative Algorithms
- Iteration and Efficiency
- A Case Study in Design and Analysis: Efficient Sorting
Part III Introduction to Data Structures
- Lists
- Queues and Stacks
- Binary Trees
- Case Studies in Design: Abstracting Indirection
Part IV The Limits of Computer Science
- Exponential Growth
- Limits to Performance
- The Halting Problem

Appendix A Object-oriented Programming in Java
Appendix B About the Web Site

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Charles River Media
Auteur(s)	Douglas L. Baldwin, Greg W. Scragg
Collection	Computer engineering series
Parution	13/07/2004
Nb. de pages	620
Format	19 x 23,5
Couverture	Broché
Poids	1070g
Intérieur	Noir et Blanc
EAN13	9781584502500
ISBN13	978-1-58450-250-0