《简化的数据结构和算法:数据结构和算法难题》原名《Data Structures And Algorithms Made Easy》Narasimha Karumanchi【文字版_PDF电子书_下载

《简化的数据结构和算法:数据结构和算法难题,Data Structures And Algorithms Made Easy》封面图片

内容简介:

Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists.

A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry.The book has around 21 chapters and covers Recursion and Backtracking, Linked Lists, Stacks, Queues,Trees, Priority Queue and Heaps, Disjoint Sets ADT, Graph Algorithms, Sorting, Searching, Selection Algorithms [Medians], Symbol Tables, Hashing, String Algorithms, Algorithms Design Techniques, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Complexity Classes, and other Miscellaneous Concepts.

Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in March, and it is coded in C/C++ language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in Java. In short, this book offers solutions to various complex data structures and algorithmic problems.

What is unique?

Our main objective isn't to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities. In other words, we enumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities.

Topics Covered:

Introduction

Recursion and Backtracking

Linked Lists

Stacks

Queues

Trees

Priority Queue and Heaps

Disjoint Sets ADT

Graph Algorithms

Sorting

Searching

Selection Algorithms [Medians]

Symbol Tables

Hashing

String Algorithms

Algorithms Design Techniques

Greedy Algorithms

Divide and Conquer Algorithms

Dynamic Programming

Complexity Classes

Miscellaneous Concepts

Target Audience?

These books prepare readers for interviews, exams, and campus work.

Language?

All code was written in C/C++. If you are using Java, please search for "Data Structures and Algorithms Made Easy in Java".

Also, check out sample chapters and the blog at: CareerMonk.com

目  录:

Chapter 1. Introduction

Chapter 2. Recursion and Backtracking

Chapter 3. Linked Lists

Chapter 4. Stacks

Chapter 5. Queues

Chapter 6. Trees

Chapter 7. Priority Queues and Heaps

Chapter 8. Disjoint Sets ADT

Chapter 9. Graph Algorithms

Chapter 10. Sorting

Chapter 11. Searching

Chapter 12. Selection Algorithms [Medians]

Chapter 13. Symbol Tables

Chapter 14. Hashing

Chapter 15. String Algorithms

Chapter 16. Algorithms Design Techniques

Chapter 17. Greedy Algorithms

Chapter 18. Divide and Conquer Algorithms

Chapter 19. Dynamic Programming

Chapter 20. Complexity Classes

Chapter 21. Miscellaneous Concepts

猜你喜欢