Book Image

Learn Data Structures and Algorithms with Golang

By : Bhagvan Kommadi
Book Image

Learn Data Structures and Algorithms with Golang

By: Bhagvan Kommadi

Overview of this book

Golang is one of the fastest growing programming languages in the software industry. Its speed, simplicity, and reliability make it the perfect choice for building robust applications. This brings the need to have a solid foundation in data structures and algorithms with Go so as to build scalable applications. Complete with hands-on tutorials, this book will guide you in using the best data structures and algorithms for problem solving. The book begins with an introduction to Go data structures and algorithms. You'll learn how to store data using linked lists, arrays, stacks, and queues. Moving ahead, you'll discover how to implement sorting and searching algorithms, followed by binary search trees. This book will also help you improve the performance of your applications by stringing data types and implementing hash structures in algorithm design. Finally, you'll be able to apply traditional data structures to solve real-world problems. By the end of the book, you'll have become adept at implementing classic data structures and algorithms in Go, propelling you to become a confident Go programmer.
Table of Contents (16 chapters)
Free Chapter
Section 1: Introduction to Data Structures and Algorithms and the Go Language
Section 2: Basic Data Structures and Algorithms using Go
Section 3: Advanced Data Structures and Algorithms using Go


  1. Which factors are considered when choosing a garbage collection algorithm?
  2. In which reference counting algorithm are program-variable references ignored?
  3. What is the type of reference counting algorithm in which a single-bit flag is used for counting?
  4. In which reference counting algorithm is a weight assigned to each reference?
  5. Who invented weighted reference counting?
  6. Which garbage collection algorithm was proposed by Dijkstra?
  7. What class handles concurrency when the mark-and-sweep collector is running?
  8. What are the criteria for promoting objects to older generations?
  9. Draw a flow chart for the cache management algorithm.
  10. How do you get indirect memory access outside a method's stack frame?