Logo

Problem Solving with Algorithms and Data Structures Using Python

Large book cover: Problem Solving with Algorithms and Data Structures Using Python

Problem Solving with Algorithms and Data Structures Using Python
by

Publisher: Franklin, Beedle & Associates
ISBN/ASIN: 1590282574
ISBN-13: 9781590282571
Number of pages: 438

Description:
This textbook is designed to serve as a text for a first course on data structures and algorithms, typically taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.

Home page url

Download or read it online for free here:
Read online
(online html)

Similar books

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.
(12535 views)
Book cover: Algorithms for Clustering DataAlgorithms for Clustering Data
by - Prentice Hall
The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
(13980 views)
Book cover: Data Structures and Algorithm Analysis in C++Data Structures and Algorithm Analysis in C++
by - Dover Publications
A comprehensive treatment focusing on efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ programming language and is suitable for second-year courses.
(11990 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(10375 views)