國立虎尾科技大學 |

Animated Program Design = Intermediate Program Design Using Video Game Development /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Animated Program Design/ by Marco T. Morazán.
其他題名:	Intermediate Program Design Using Video Game Development /
作者:	Morazán, Marco T.
面頁冊數:	XIX, 514 p. 1 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Game Development. -
電子資源:	https://doi.org/10.1007/978-3-031-04317-8
ISBN:	9783031043178

Animated Program Design = Intermediate Program Design Using Video Game Development /
Morazán, Marco T.

Animated Program DesignIntermediate Program Design Using Video Game Development /[electronic resource] :by Marco T. Morazán. - 1st ed. 2022. - XIX, 514 p. 1 illus.online resource. - Texts in Computer Science,1868-095X. - Texts in Computer Science,.

Part I: Basic Problem Solving and Program Design -- 1. The Science of Problem Solving -- 2. The N-Puzzle Problem -- 3. Randomness -- Part II: Generative Recursion -- 4. Introduction to Generative Recursion -- 5. Sorting -- 6. Searching -- 7. N-Puzzle Version 2 -- 8. N-Puzzle Version 3 -- Part III: Accumulative Recursion -- 9. Accumulators -- 10. N-Puzzle Versions 4 and 5 -- 11. Iteration -- 12. N-Puzzle Version 6 -- 13. Continuation-Passing Style -- Part IV: Mutation -- 14. Sharing Values -- 15. Mutation Sequencing -- 16. Vectors -- 17. In-Place Operations -- 18. The Chicken and the Egg Paradox -- Part V: Epilogue -- 19. Where to go from here.

This textbook presents a systematic methodology for program development by using design recipes, i.e. a series of steps, each with a specific outcome, that takes a problem solver from a problem statement to a working and tested programmed solution. It introduces the reader to generative recursion, heuristic searching, accumulative recursion, tail recursion, iteration, mutation, loops, program correctness, and vectors. It uses video game development to make the content fun while at the same time teaching problem-solving techniques. The book is divided into four parts. Part I presents introductory material on basic problem solving and program design. It starts by reviewing the basic steps of a design recipe using structural recursion on a list. It then proceeds to review code refactoring–a common technique used to refine programs when a better or more elegant way is found to solve a problem–and introduces the reader to randomness. Next, Part II explores a new type of recursion called generative recursion. It navigates the reader through examples involving fractal image generation, efficient sorting, and efficient searching techniques such as binary, depth-first, and breadth-first search. Part III then explores a new type of recursion called accumulative (or accumulator) recursion. Examples used include finding a path in a graph, improving insertion sorting, and list-folding operations. Finally, Part IV explores mutation. To aid the reader in properly sequencing mutations it presents Hoare Logic and program correctness. In addition, it introduces vectors, vector processing, in-place operations, and circular data. Throughout the whole book complexity analysis and empirical experimentation is used to evaluate solutions. This textbook targets undergraduates at all levels as well as graduate students wishing to learn about program design. It details advanced types of recursion, a disciplined approach to the use of mutation, and illustrates the design process by developing a video game exploiting iterative refinement.

ISBN: 9783031043178

Standard No.: 10.1007/978-3-031-04317-8doiSubjects--Topical Terms:

1114505
Game Development.

LC Class. No.: QA76.758

Dewey Class. No.: 005.1

Animated Program Design = Intermediate Program Design Using Video Game Development /
LDR:04105nam a22004095i 4500 001 1083476
003 DE-He213
005 20220924014006.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031043178 $9 978-3-031-04317-8
024 7 $a 10.1007/978-3-031-04317-8 $2 doi
035 $a 978-3-031-04317-8
050 4 $a QA76.758
072 7 $a UMZ $2 bicssc
072 7 $a COM051230 $2 bisacsh
072 7 $a UMZ $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Morazán, Marco T. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1389467
245 1 0 $a Animated Program Design $h [electronic resource] : $b Intermediate Program Design Using Video Game Development / $c by Marco T. Morazán.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIX, 514 p. 1 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Texts in Computer Science, $x 1868-095X
505 0 $a Part I: Basic Problem Solving and Program Design -- 1. The Science of Problem Solving -- 2. The N-Puzzle Problem -- 3. Randomness -- Part II: Generative Recursion -- 4. Introduction to Generative Recursion -- 5. Sorting -- 6. Searching -- 7. N-Puzzle Version 2 -- 8. N-Puzzle Version 3 -- Part III: Accumulative Recursion -- 9. Accumulators -- 10. N-Puzzle Versions 4 and 5 -- 11. Iteration -- 12. N-Puzzle Version 6 -- 13. Continuation-Passing Style -- Part IV: Mutation -- 14. Sharing Values -- 15. Mutation Sequencing -- 16. Vectors -- 17. In-Place Operations -- 18. The Chicken and the Egg Paradox -- Part V: Epilogue -- 19. Where to go from here.
520 $a This textbook presents a systematic methodology for program development by using design recipes, i.e. a series of steps, each with a specific outcome, that takes a problem solver from a problem statement to a working and tested programmed solution. It introduces the reader to generative recursion, heuristic searching, accumulative recursion, tail recursion, iteration, mutation, loops, program correctness, and vectors. It uses video game development to make the content fun while at the same time teaching problem-solving techniques. The book is divided into four parts. Part I presents introductory material on basic problem solving and program design. It starts by reviewing the basic steps of a design recipe using structural recursion on a list. It then proceeds to review code refactoring–a common technique used to refine programs when a better or more elegant way is found to solve a problem–and introduces the reader to randomness. Next, Part II explores a new type of recursion called generative recursion. It navigates the reader through examples involving fractal image generation, efficient sorting, and efficient searching techniques such as binary, depth-first, and breadth-first search. Part III then explores a new type of recursion called accumulative (or accumulator) recursion. Examples used include finding a path in a graph, improving insertion sorting, and list-folding operations. Finally, Part IV explores mutation. To aid the reader in properly sequencing mutations it presents Hoare Logic and program correctness. In addition, it introduces vectors, vector processing, in-place operations, and circular data. Throughout the whole book complexity analysis and empirical experimentation is used to evaluate solutions. This textbook targets undergraduates at all levels as well as graduate students wishing to learn about program design. It details advanced types of recursion, a disciplined approach to the use of mutation, and illustrates the design process by developing a video game exploiting iterative refinement.
650 2 4 $a Game Development. $3 1114505
650 2 4 $a Programming Techniques. $3 669781
650 1 4 $a Software Engineering. $3 669632
650 0 $a Computer games—Programming. $3 1256819
650 0 $a Computer programming. $3 527822
650 0 $a Software engineering. $3 562952
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031043161
776 0 8 $i Printed edition: $z 9783031043185
776 0 8 $i Printed edition: $z 9783031043192
830 0 $a Texts in Computer Science, $x 1868-0941 $3 1254292
856 4 0 $u https://doi.org/10.1007/978-3-031-04317-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)