國立虎尾科技大學 |

Generic Data Structures and Algorithms in Go = An Applied Approach Using Concurrency, Genericity and Heuristics /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Generic Data Structures and Algorithms in Go/ by Richard Wiener.
其他題名:	An Applied Approach Using Concurrency, Genericity and Heuristics /
作者:	Wiener, Richard.
面頁冊數:	XXV, 579 p. 70 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Numerical Analysis. -
電子資源:	https://doi.org/10.1007/978-1-4842-8191-8
ISBN:	9781484281918

Generic Data Structures and Algorithms in Go = An Applied Approach Using Concurrency, Genericity and Heuristics /
Wiener, Richard.

Generic Data Structures and Algorithms in GoAn Applied Approach Using Concurrency, Genericity and Heuristics /[electronic resource] :by Richard Wiener. - 1st ed. 2022. - XXV, 579 p. 70 illus.online resource.

1. A Tour Of Generics and Concurrency In Go -- 2. Algorithm Efficiency – Sorting and Searching -- 3. Abstract Data Types: OOP Without Classes in Go -- 4. ADT In Action: Game Of Life -- 5. Stacks -- 6. Queues and Lists -- 7. Hash Tables -- 8. Binary Trees -- 9. Binary Search Tree -- 10. AVL Trees -- 11. Heap Trees -- 12. Red Black Trees -- 13. Expression Trees -- 14. Ecological Simulation With Concurrency -- 15. Dynamic Programming -- 16. Graph Structures -- 17. Travelling Salesperson Problem -- 18. Branch and Bound Solution to TSP -- 19. Simulated Annealing Heuristic Solution to TSP -- 20. Genetic Algorithm for TSP -- 21. Neural Networks and Machine Learning.

Advance your understanding of generic data structures and algorithms and their applications using Go and the effective use of concurrency. You are invited on a journey that aims to improve your programming and problem-solving skills. This book takes you to the next step by showing how to get your programs to work efficiently as well as correctly. As you explore many data structures and the algorithms and applications associated with them, you'll focus on the trade-offs between speed and storage and the benefits of deploying concurrency when appropriate. This book will demonstrate the huge increases in application performance that are possible. The presentation of classic data structures and techniques of algorithm design (greedy, divide and conquer, branch-and-bound to name a few) provides an essential foundation and toolkit for problem solving. But this book goes further by presenting heuristic algorithms and their implementations for solving computationally intractable combinatoric optimization problems such as the travelling salesperson problem. Simulated annealing and genetic algorithms are among the techniques used. The consistent style of coding used throughout this book exploits Go’s ability to implement abstract, generic and constrained generic data types without the use of classes. Although some familiarity with Go is assumed, this book should advance your ability to use Go to tackle server-side applications, games, machine learning, information retrieval and other application domains where speed and storage efficiency is essential. You will: Explore classical data structures and algorithms aimed at making your applications run faster or require less storage Use the new generic features of Go to build reusable data structures Utilize concurrency for maximizing application performance See the power of heuristic algorithms for computationally intractable problems Enhance and improve your Go programming skills.

ISBN: 9781484281918

Standard No.: 10.1007/978-1-4842-8191-8doiSubjects--Topical Terms:

671433
Numerical Analysis.

LC Class. No.: QA76.7-.73

Dewey Class. No.: 005.13

Generic Data Structures and Algorithms in Go = An Applied Approach Using Concurrency, Genericity and Heuristics /
LDR:04017nam a22003975i 4500 001 1088438
003 DE-He213
005 20221104140836.0
007 cr nn 008mamaa
008 221228s2022 xxu| s |||| 0|eng d
020 $a 9781484281918 $9 978-1-4842-8191-8
024 7 $a 10.1007/978-1-4842-8191-8 $2 doi
035 $a 978-1-4842-8191-8
050 4 $a QA76.7-.73
072 7 $a UMX $2 bicssc
072 7 $a COM000000 $2 bisacsh
072 7 $a UMX $2 thema
082 0 4 $a 005.13 $2 23
100 1 $a Wiener, Richard. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1395630
245 1 0 $a Generic Data Structures and Algorithms in Go $h [electronic resource] : $b An Applied Approach Using Concurrency, Genericity and Heuristics / $c by Richard Wiener.
250 $a 1st ed. 2022.
264 1 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2022.
300 $a XXV, 579 p. 70 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
505 0 $a 1. A Tour Of Generics and Concurrency In Go -- 2. Algorithm Efficiency – Sorting and Searching -- 3. Abstract Data Types: OOP Without Classes in Go -- 4. ADT In Action: Game Of Life -- 5. Stacks -- 6. Queues and Lists -- 7. Hash Tables -- 8. Binary Trees -- 9. Binary Search Tree -- 10. AVL Trees -- 11. Heap Trees -- 12. Red Black Trees -- 13. Expression Trees -- 14. Ecological Simulation With Concurrency -- 15. Dynamic Programming -- 16. Graph Structures -- 17. Travelling Salesperson Problem -- 18. Branch and Bound Solution to TSP -- 19. Simulated Annealing Heuristic Solution to TSP -- 20. Genetic Algorithm for TSP -- 21. Neural Networks and Machine Learning.
520 $a Advance your understanding of generic data structures and algorithms and their applications using Go and the effective use of concurrency. You are invited on a journey that aims to improve your programming and problem-solving skills. This book takes you to the next step by showing how to get your programs to work efficiently as well as correctly. As you explore many data structures and the algorithms and applications associated with them, you'll focus on the trade-offs between speed and storage and the benefits of deploying concurrency when appropriate. This book will demonstrate the huge increases in application performance that are possible. The presentation of classic data structures and techniques of algorithm design (greedy, divide and conquer, branch-and-bound to name a few) provides an essential foundation and toolkit for problem solving. But this book goes further by presenting heuristic algorithms and their implementations for solving computationally intractable combinatoric optimization problems such as the travelling salesperson problem. Simulated annealing and genetic algorithms are among the techniques used. The consistent style of coding used throughout this book exploits Go’s ability to implement abstract, generic and constrained generic data types without the use of classes. Although some familiarity with Go is assumed, this book should advance your ability to use Go to tackle server-side applications, games, machine learning, information retrieval and other application domains where speed and storage efficiency is essential. You will: Explore classical data structures and algorithms aimed at making your applications run faster or require less storage Use the new generic features of Go to build reusable data structures Utilize concurrency for maximizing application performance See the power of heuristic algorithms for computationally intractable problems Enhance and improve your Go programming skills.
650 2 4 $a Numerical Analysis. $3 671433
650 2 4 $a Computer Science. $3 593922
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 1 4 $a Programming Language. $3 1365750
650 0 $a Numerical analysis. $3 527939
650 0 $a Computer science. $3 573171
650 0 $a Algorithms. $3 527865
650 0 $a Information theory. $3 595305
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Programming languages (Electronic computers). $3 1127615
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9781484281901
776 0 8 $i Printed edition: $z 9781484281925
776 0 8 $i Printed edition: $z 9781484291078
856 4 0 $u https://doi.org/10.1007/978-1-4842-8191-8
912 $a ZDB-2-CWD
912 $a ZDB-2-SXPC
950 $a Professional and Applied Computing (SpringerNature-12059)
950 $a Professional and Applied Computing (R0) (SpringerNature-43716)