Muutke küpsiste eelistusi

Thinking Recursively [Pehme köide]

  • Formaat: Paperback / softback, 192 pages, kõrgus x laius x paksus: 235x158x10 mm, kaal: 284 g
  • Ilmumisaeg: 05-Mar-1986
  • Kirjastus: John Wiley & Sons Inc
  • ISBN-10: 0471816523
  • ISBN-13: 9780471816522
Teised raamatud teemal:
  • Formaat: Paperback / softback, 192 pages, kõrgus x laius x paksus: 235x158x10 mm, kaal: 284 g
  • Ilmumisaeg: 05-Mar-1986
  • Kirjastus: John Wiley & Sons Inc
  • ISBN-10: 0471816523
  • ISBN-13: 9780471816522
Teised raamatud teemal:
The process of solving large problems by breaking them down into smaller, more simple problems that have identical forms. Thinking Recursively: A small text to solve large problems. Concentrating on the practical value of recursion. this text, the first of its kind, is essential to computer science students’ education. In this text, students will learn the concept and programming applications of recursive thinking. This will ultimately prepare students for advanced topics in computer science such as compiler construction, formal language theory, and the mathematical foundations of computer science. Key Features:
  • Concentration on the practical value of recursion.
  • Eleven chapters emphasizing recursion as a unified concept.
  • Extensive discussion of the mathematical concepts which help the students to develop an appropriate conceptual model.
  • Large number of imaginative examples with solutions.
  • Large sets of exercises.
Preface vii
The Idea of Recursion
1(12)
An Illustration of the Recursive Approach
1(3)
Mondrian and Computer Art
4(3)
Characteristics of Recursive Algorithms
7(1)
Nonterminating Recursion
8(1)
Thinking about Recursion--Two Perspectives
9(4)
Mathematical Preliminaries
13(18)
Mathematical Induction
14(5)
Computational Complexity
19(12)
Recursive Function
31(16)
Functional vs. Procedural Recursion
32(1)
Factorials
32(4)
The Fibonacci Sequence
36(11)
The Procedural Approach
47(16)
Numeric Output
49(5)
Generating a Primer
54(9)
The Tower of Hanoi
63(12)
The Recursive Solution
64(3)
The Reductionistic View
67(8)
Permutations
75(8)
Sorting
83(20)
Selection Sorting
85(4)
Merge Sorting
89(14)
Intelligent Algorithms
103(22)
Backtracking through a Maze
104(9)
Lookahead Strategies
113(12)
Graphical Applications
125(14)
Computer Graphics in Pascal
126(2)
Fractal Geometry
128(11)
Recursive Data
139(22)
Representing Strings as Linked Lists
141(4)
Binary Trees
145(7)
Expression Trees
152(9)
Implementation of Recursion
161(14)
The Control Stack Model
161(5)
Simulating Recursion
166(9)
Bibliography 175(2)
Index 177
Eric S. Roberts is an American computer scientist noted for his contributions to computer science education through textbook authorship and his leadership in computing curriculum development.