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: Introduction to Design Analysis of AlgorithmsIntroduction to Design Analysis of Algorithms
by - Smashwords
This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.
(5793 views)
Book cover: Computer Arithmetic of Geometrical Figures: Algorithms and Hardware DesignComputer Arithmetic of Geometrical Figures: Algorithms and Hardware Design
by - MiC
This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.
(6265 views)
Book cover: Algorithms: Fundamental TechniquesAlgorithms: Fundamental Techniques
by - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
(12295 views)
Book cover: Algorithms and Data Structures for External MemoryAlgorithms and Data Structures for External Memory
by - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
(7777 views)