001448184 000__ 04671cam\a2200493\a\4500
001448184 001__ 1448184
001448184 003__ OCoLC
001448184 005__ 20230310004225.0
001448184 006__ m\\\\\o\\d\\\\\\\\
001448184 007__ cr\cn\nnnunnun
001448184 008__ 220716s2022\\\\cau\\\\\o\\\\\001\0\eng\d
001448184 019__ $$a1336007352
001448184 020__ $$a9781484281918$$q(electronic bk.)
001448184 020__ $$a1484281918$$q(electronic bk.)
001448184 020__ $$z148428190X
001448184 020__ $$z9781484281901
001448184 0247_ $$a10.1007/978-1-4842-8191-8$$2doi
001448184 035__ $$aSP(OCoLC)1336406061
001448184 040__ $$aEBLCP$$beng$$epn$$cEBLCP$$dORMDA$$dEBLCP$$dGW5XE$$dYDX$$dOCLCQ$$dOCLCF$$dUKAHL$$dOCLCQ
001448184 049__ $$aISEA
001448184 050_4 $$aQA76.9.D35
001448184 08204 $$a005.13/3$$223/eng/20220719
001448184 1001_ $$aWiener, Richard,$$d1941-
001448184 24510 $$aGeneric data structures and algorithms in Go :$$ban applied approach using concurrency, genericity and heuristics /$$cRichard Wiener.
001448184 260__ $$aBerkeley, CA :$$bApress L.P.,$$c2022.
001448184 300__ $$a1 online resource (590 pages)
001448184 336__ $$atext$$btxt$$2rdacontent
001448184 337__ $$acomputer$$bc$$2rdamedia
001448184 338__ $$aonline resource$$bcr$$2rdacarrier
001448184 5050_ $$a1. 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.
001448184 506__ $$aAccess limited to authorized users.
001448184 520__ $$aAdvance 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. What You'll Learn 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 Who This Book Is For Practicing Go software developers and students who wish to advance their programming and problem-solving skills and experience the excitement and see the benefits of using generic data structures and algorithms that utilize concurrency whenever possible.
001448184 588__ $$aDescription based on print version record.
001448184 650_0 $$aGo (Computer program language)
001448184 650_0 $$aData structures (Computer science)
001448184 650_0 $$aAlgorithms.
001448184 655_0 $$aElectronic books.
001448184 77608 $$iPrint version:$$aWiener, Richard.$$tGeneric Data Structures and Algorithms in Go.$$dBerkeley, CA : Apress L.P., ©2022$$z9781484281901
001448184 852__ $$bebk
001448184 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-1-4842-8191-8$$zOnline Access$$91397441.1
001448184 909CO $$ooai:library.usi.edu:1448184$$pGLOBAL_SET
001448184 980__ $$aBIB
001448184 980__ $$aEBOOK
001448184 982__ $$aEbook
001448184 983__ $$aOnline
001448184 994__ $$a92$$bISE