Название: Data Structures with Python: Get familiar with the common Data Structures and Algorithms in Python
Автор: Dr. Harsh Bhasin
Издательство: BPB Publications
Год: 2023
Страниц: 404
Язык: английский
Формат: epub (true)
Размер: 10.2 MB

Develop a strong foundation in Data Structures and Algorithms and become a skilled programmer.

Description:
Data structures are a way of organizing and storing data in a computer so that it can be accessed and manipulated efficiently. If you want to become an accomplished programmer and master this subject, then this book is for you.

The book starts by introducing you to the fascinating world of data structures and algorithms. This book will help you learn about different algorithmic techniques such as Dynamic programming, Greedy algorithms, and Backtracking, and their applications in solving various computational problems. The book will then teach you how to analyze the complexity of Recursive algorithms. Moving on, the book will help you get familiar with the concept of Linked lists, which is an important foundation for understanding other data structures, such as Stacks and Queues, which are covered in detail later in this book. The book will also teach you about advanced data structures such as Trees and Graphs, their different types, and their applications. Towards the end, the book will teach you how to use various Sorting, Searching Selection and String algorithms.

This book introduces the reader to Data Structures and Algorithms, the foundation stone of programming. The concepts discussed in this book will help the reader to understand various data structures, analyze the time and space complexity, and use these data structures for solving graded problems.

The first chapter introduces the reader to the fascinating world of Algorithms and Data Structures. The idea of complexity has been introduced in the chapter. It contains ample examples of finding the complexity of a given algorithm.

The next chapter takes the reader through various approaches to developing algorithms. The chapter introduces the Greedy approach, divide and conquer, dynamic programming, and backtracking. An introduction to branch and bound has also been included in the chapter.

Recursion has been introduced in the third chapter of this book. The chapter contains the mechanism, examples, and the process of finding the complexity of a recursive algorithm. The problems related to arrays have been discussed in the fourth chapter of this book. It presents insertion, deletion, and searching in arrays along with the complexities.

Chapter 5 discusses Linked Lists. The algorithms, complexity, and problems of linked lists have been covered in this chapter. This chapter forms the basis of the following chapters. The next two chapters introduce stacks and queues. The applications of these data structures have also been included in the chapters. These chapters contain assorted problems related to stacks and queues.

Chapters 8 and 9 deal with trees and heaps. The insertion and deletion in binary trees and other algorithms have been included in these chapters. Chapter ten introduces priority queues. The next chapter discusses graphs. It contains traversal algorithms, spanning tree algorithms, and shortest path algorithms.

Chapter 11 contains eleven sorting techniques and discusses the related problems. selection has been dealt with in the next chapter. A very efficient searching technique called hashing has been explained in detail in the fourteen chapters. The last chapter deals with the String algorithms.

The book also contains four appendices containing Dijkstra's algorithm, all pairs' shortest path, and tree traversals using stacks and problems.

By the end of the book, you will get a comprehensive and in-depth understanding of various data structures and algorithms and their applications in solving real-world computational problems efficiently.

What you will learn:
- Get familiar with the fundamentals of data structures such as arrays, linked lists, stacks, and queues.
- Understand the basics of algorithm analysis and complexity theory.
- Explore different approaches to the algorithm design, such as divide-and-conquer, dynamic programming, and greedy algorithms.

Who this book is for:
The book is aimed at Computer Science students, Software Engineers, and anyone interested in learning about data structures and algorithms