Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Learn Data Structures and Algorithms with Golang

You're reading from   Learn Data Structures and Algorithms with Golang Level up your Go programming skills to develop faster and more efficient code

Arrow left icon
Product type Paperback
Published in Mar 2019
Publisher Packt
ISBN-13 9781789618501
Length 336 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Bhagvan Kommadi Bhagvan Kommadi
Author Profile Icon Bhagvan Kommadi
Bhagvan Kommadi
Arrow right icon
View More author details
Toc

Table of Contents (16) Chapters Close

Preface 1. Section 1: Introduction to Data Structures and Algorithms and the Go Language FREE CHAPTER
2. Data Structures and Algorithms 3. Getting Started with Go for Data Structures and Algorithms 4. Section 2: Basic Data Structures and Algorithms using Go
5. Linear Data Structures 6. Non-Linear Data Structures 7. Homogeneous Data Structures 8. Heterogeneous Data Structures 9. Dynamic Data Structures 10. Classic Algorithms 11. Section 3: Advanced Data Structures and Algorithms using Go
12. Network and Sparse Matrix Representation 13. Memory Management 14. Next Steps 15. Other Books You May Enjoy

Questions and exercises

  1. Give an example where you can use a composite pattern.
  2. For an array of 10 elements with a random set of integers, identify the maximum and minimum. Calculate the complexity of the algorithm.
  3. To manage the state of an object, which structural pattern is relevant?
  4. A window is sub-classed to add a scroll bar to make it a scrollable window. Which pattern is applied in this scenario?
  5. Find the complexity of a binary tree search algorithm.
  6. Identify the submatrices of 2x2 in a 3x3 matrix. What is the complexity of the algorithm that you have used?
  7. Explain with a scenario the difference between brute force and backtracking algorithms.

  1. A rules engine uses backtracking to identify the rules affected by the change. Show an example where backtracking identifies the affected rules.
  2. Draw a flow chart for the algorithm of the calculation of profit-loss given the cost...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image