|Categories||Download eBook: Fundamental Data Structures|
A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.
This book covers most of commonly used data structures in computer science: abstract data types; Sequences; Dictionaries; Sets; Priority queues; Successors and neighbors; Integer and string searching, etc.
It describes data structures from the point of view of computer programming, with examples, and presents design techniques that allow programmers to develop their own data structures. The authors include both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for programming languages.
It also offers solutions to complex data structures and algorithms. There are multiple solutions for each problem. It comes handy as an interview and exam guide for computer scientists.
More Data Structures and Algorithms eBooks:
Linear Programming: Foundations and Extensions
Algorithms and Data Structures With Applications to Graphics and Geometry
Matters Computational: Ideas, Algorithms, Source Code
Ant Colony Optimization - Techniques and Applications
Introduction to Design Analysis of Algorithms
Solving NP-Complete Problems
Think Complexity: Complexity Science and Computational Modeling
Traveling Salesman Problem, Theory and Applications
Knapsack Problems: Algorithms and Computer Implementations
Information Theory, Inference and Learning Algorithms
Real-World Applications of Genetic Algorithms
New Frontiers in Graph Theory
Search Algorithms for Engineering Optimization
Data Structures Succinctly, Part 2