國立虎尾科技大學 |

First Course in Algorithms Through Puzzles

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	First Course in Algorithms Through Puzzles/ by Ryuhei Uehara.
作者:	Uehara, Ryuhei.
面頁冊數:	XI, 175 p. 68 illus., 3 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-981-13-3188-6
ISBN:	9789811331886

First Course in Algorithms Through Puzzles
Uehara, Ryuhei.

First Course in Algorithms Through Puzzles[electronic resource] /by Ryuhei Uehara. - 1st ed. 2019. - XI, 175 p. 68 illus., 3 illus. in color.online resource.

Chapter 1. Preliminaries -- Chapter 2. Recursive call -- Chapter 3. Algorithms for Searching and Sorting -- Chapter 4. Searching on graphs -- Chapter 5. Backtracking -- Chapter 6. Randomized Algorithms -- Chapter 7. References -- Chapter 8. Answers to exercises.

This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms. More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author’s steps to solve problems and to gain a better understanding of the contents. Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.

ISBN: 9789811331886

Standard No.: 10.1007/978-981-13-3188-6doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

First Course in Algorithms Through Puzzles
LDR:02755nam a22003855i 4500 001 1009959
003 DE-He213
005 20200701030249.0
007 cr nn 008mamaa
008 210106s2019 si | s |||| 0|eng d
020 $a 9789811331886 $9 978-981-13-3188-6
024 7 $a 10.1007/978-981-13-3188-6 $2 doi
035 $a 978-981-13-3188-6
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Uehara, Ryuhei. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 897136
245 1 0 $a First Course in Algorithms Through Puzzles $h [electronic resource] / $c by Ryuhei Uehara.
250 $a 1st ed. 2019.
264 1 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2019.
300 $a XI, 175 p. 68 illus., 3 illus. in color. $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
505 0 $a Chapter 1. Preliminaries -- Chapter 2. Recursive call -- Chapter 3. Algorithms for Searching and Sorting -- Chapter 4. Searching on graphs -- Chapter 5. Backtracking -- Chapter 6. Randomized Algorithms -- Chapter 7. References -- Chapter 8. Answers to exercises.
520 $a This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms. More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author’s steps to solve problems and to gain a better understanding of the contents. Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.
650 0 $a Algorithms. $3 527865
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9789811331879
776 0 8 $i Printed edition: $z 9789811331893
856 4 0 $u https://doi.org/10.1007/978-981-13-3188-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)