Thinking Recursively with Java / Edition 1

Thinking Recursively with Java / Edition 1

by Eric S. Roberts
ISBN-10:
0471701467
ISBN-13:
2900471701469
Pub. Date:
11/09/2005
Publisher:
Thinking Recursively with Java / Edition 1

Thinking Recursively with Java / Edition 1

by Eric S. Roberts
$51.13
Current price is , Original price is $70.75. You
$70.75 
  • SHIP THIS ITEM
    This Item is Not Available
  • PICK UP IN STORE

    Your local store may have stock of this item.

$51.13  $70.75 Save 28% Current price is $51.13, Original price is $70.75. You Save 28%.
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.

    Note: Access code and/or supplemental material are not guaranteed to be included with used textbook.

Overview

To provide students with a more effective treatment of this difficult topic, John Wiley and Sons, Inc. published Thinking Recursively by Eric Roberts. Since its publication in 1986, Thinking Recursively has become a classic in a field in which books quickly become obsolete. By focusing on effective problem-solving strategies that enable students to "think recursively," this text has helped many students over the conceptual hurdle that recursion so often represents. Moreover, by including many more examples and exercises than typical, Thinking Recursivelymakes it possible for students to master recursive techniques. To celebrate the 20th anniversary of its initial publication, John Wiley and Sons is publishing Thinking Recursively with Java, making the book even more relevant to today's students.

Course Hierarchy:

May fit a variety of Java programming courses as a supplement at the introductory or intermediate levels or serve as a core text in intermediate or advanced level programming courses.


Product Details

ISBN-13: 2900471701469
Publication date: 11/09/2005
Pages: 188
Product dimensions: 6.00(w) x 1.25(h) x 9.00(d)

About the Author

Eric Roberts is Professor of Computer Science and John and Cynthia Gunn University Fellow in Undergraduate Education at Stanford University. He is widely recognized as an expert teacher and has won numerous teaching awards at Stanford. He was the principal author of the ACM/IEEE-CS report on Computing Curricula 2001 and received the ACM-SIGCSE Award for Outstanding Contributions to Computer Science Education in 2003.

Table of Contents

Preface.

1. The Idea of Recursion.

2. Mathematical Preliminaries.

3. Recursive Functions.

4. The Procedural Approach.

5. The Tower of Hanoi.

6. Permutations.

7. Sorting.

8. Recursive Backtracking.

9. Graphical Applications.

10. Recursive Data.

11. Implementation of Recursion.

Index.

From the B&N Reads Blog

Customer Reviews