Algorithms & Data Structures: The Science of Computing

Description

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

The science of computing's three methods of inquiry
Program design
Introduction to data structures
The limits of computer science