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: Elementary AlgorithmsElementary Algorithms
by - Github
'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.
(1884 views)
Book cover: Design and Analysis of AlgorithmsDesign and Analysis of Algorithms
by - Duke University
The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.
(12247 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.
(10841 views)
Book cover: Knapsack Problems: Algorithms and Computer ImplementationsKnapsack Problems: Algorithms and Computer Implementations
by - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
(11228 views)