Generic Data Structures and Algorithms in Go: An Applied Approach Using Concurrency, Genericity and Heuristics
Autor Richard Wieneren Limba Engleză Paperback – 13 iul 2022
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 forsolving 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
Preț: 334.95 lei
Preț vechi: 418.69 lei
-20% Nou
Puncte Express: 502
Preț estimativ în valută:
64.10€ • 68.05$ • 53.41£
64.10€ • 68.05$ • 53.41£
Carte disponibilă
Livrare economică 06-20 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781484281901
ISBN-10: 148428190X
Pagini: 579
Ilustrații: XXV, 579 p. 70 illus.
Dimensiuni: 178 x 254 mm
Greutate: 1.04 kg
Ediția:1st ed.
Editura: Apress
Colecția Apress
Locul publicării:Berkeley, CA, United States
ISBN-10: 148428190X
Pagini: 579
Ilustrații: XXV, 579 p. 70 illus.
Dimensiuni: 178 x 254 mm
Greutate: 1.04 kg
Ediția:1st ed.
Editura: Apress
Colecția Apress
Locul publicării:Berkeley, CA, United States
Cuprins
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.
Notă biografică
Richard Wiener, Ph.D. authored or co-authored 22 professional, software development and computer-science textbooks published by Wiley, Addison-Wesley, Prentice-Hall, Cambridge University Press and Thompson. Served as founding Editor-in-Chief of the Journal of Object-Oriented Programming for 12 years and later, founding Editor-in-Chief of the Journal of Object Technology for 9 years. Worked as Associate Professor of Computer Science at the University of Colorado, Colorado Springs (UCCS) from 1977-2012. Served as Department Chair during last four years at UCCS. Served as consultant and software developer for IBM, HP, Boeing, Textronix, DEC and many other companies. Presented industry short-courses all over the world from 1980 to 2006. Earned BS and MS in Electrical Engineering from City University of New York and Ph.D. from Polytechnic Institute of New York.
Textul de pe ultima copertă
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
Caracteristici
Uniquely covers generics-based data structures and algorithms in Golang Features the use of concurrency using go-routines whenever possible and appropriate Presents heuristic algorithm design in solving computationally hard problems such as combinatoric optimization