語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
到查詢結果
[ author_sort:"uehara, ryuhei." ]
切換:
標籤
|
MARC模式
|
ISBD
First course in algorithms through p...
~
SpringerLink (Online service)
First course in algorithms through puzzles
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
First course in algorithms through puzzlesby Ryuhei Uehara.
作者:
Uehara, Ryuhei.
出版者:
Singapore :Springer Singapore :2019.
面頁冊數:
xi, 175 p. :ill. (some col.), digital ;24 cm.
Contained By:
Springer eBooks
標題:
Computer algorithms.
電子資源:
https://doi.org/10.1007/978-981-13-3188-6
ISBN:
9789811331886$q(electronic bk.)
First course in algorithms through puzzles
Uehara, Ryuhei.
First course in algorithms through puzzles
[electronic resource] /by Ryuhei Uehara. - Singapore :Springer Singapore :2019. - xi, 175 p. :ill. (some col.), digital ;24 cm.
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$q(electronic bk.)
Standard No.: 10.1007/978-981-13-3188-6doiSubjects--Topical Terms:
184478
Computer algorithms.
LC Class. No.: QA9.58
Dewey Class. No.: 005.1
First course in algorithms through puzzles
LDR
:02432nmm a2200325 a 4500
001
555215
003
DE-He213
005
20181206180919.0
006
m d
007
cr nn 008maaau
008
191121s2019 si s 0 eng d
020
$a
9789811331886$q(electronic bk.)
020
$a
9789811331879$q(paper)
024
7
$a
10.1007/978-981-13-3188-6
$2
doi
035
$a
978-981-13-3188-6
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA9.58
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
090
$a
QA9.58
$b
.U22 2019
100
1
$a
Uehara, Ryuhei.
$3
339412
245
1 0
$a
First course in algorithms through puzzles
$h
[electronic resource] /
$c
by Ryuhei Uehara.
260
$a
Singapore :
$b
Springer Singapore :
$b
Imprint: Springer,
$c
2019.
300
$a
xi, 175 p. :
$b
ill. (some col.), digital ;
$c
24 cm.
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
Computer algorithms.
$3
184478
650
1 4
$a
Algorithm Analysis and Problem Complexity.
$3
273702
650
2 4
$a
Algorithms.
$3
184661
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
856
4 0
$u
https://doi.org/10.1007/978-981-13-3188-6
950
$a
Computer Science (Springer-11645)
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000168027
電子館藏
1圖書
電子書
EB QA9.58 U22 2019 2019
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
https://doi.org/10.1007/978-981-13-3188-6
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入