Logo

A Practical Introduction to Data Structures and Algorithm Analysis

Large book cover: A Practical Introduction to Data Structures and Algorithm Analysis

A Practical Introduction to Data Structures and Algorithm Analysis
by

Publisher: Virginia Tech
ISBN/ASIN: 0130284467
Number of pages: 638

Description:
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the data structure that will best solve a particular problem.

Home page url

Download or read it online for free here:
Download link
(2MB, PDF)

Similar books

Book cover: Data Structures and Algorithms: Annotated Reference with ExamplesData Structures and Algorithms: Annotated Reference with Examples
by - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.
(10990 views)
Book cover: Design and Analysis of Computer AlgorithmsDesign and Analysis of Computer Algorithms
by - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
(10736 views)
Book cover: Problem Solving with Algorithms and Data Structures Using PythonProblem Solving with Algorithms and Data Structures Using Python
by - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(4225 views)
Book cover: Computational Geometry: Methods and ApplicationsComputational Geometry: Methods and Applications
by
The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.
(10076 views)