Автор: Narasimha Karumanchi
Издательство: CareerMonk Publications
Год: 2020
Страниц: 520
Язык: английский
Формат: pdf
Размер: 10.1 MB
This book is about the fundamentals of data structures and algorithms – the basic elements from which large and complex software projects are built. To develop a good understanding of a data structure requires three things: first, you must learn how the information is arranged in the memory of the computer; second, you must become familiar with the algorithms for manipulating the information contained in the data structure; and third, you must understand the performance characteristics of the data structure so that when called upon to select a suitable data structure for a particular application, you are able to make an appropriate decision.
The algorithms and data structures in this book are presented in the Go programming language. A unique feature of this book, when compared to the available books on the subject, is that it offers a balance of theory, practical concepts, problem solving, and interview questions.
The book deals with some of the most important and challenging areas of programming and computer science in a highly readable manner. It covers both algorithmic theory and programming practice, demonstrating how theory is reflected in real Go programs. Well-known algorithms and data structures that are built into the Go language is explained, and the user is shown how to implement and evaluate others.
"Data Structure and Algorithmic Thinking with Go" is designed to give a jump-start to programmers, job hunters, and those who are appearing for exams. All the code in this book is written in GoLang. It contains many programming puzzles that not only encourage analytical thinking but also prepare readers for interviews. This book, with its focused and practical approach, can help readers quickly pick up the concepts and techniques for developing efficient and effective solutions to problems.
Topics Covered:
Скачать Data Structures and Algorithmic Thinking with Go: Data Structure and Algorithmic Puzzles