Data Structures and Algorithms: Annotated Reference with Examples
by Granville Barnett, Luca Del Tongo
Publisher: DotNetSlackers 2008
Number of pages: 112
This book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most imperative programming languages. We assume that the reader is familiar with the following: (1) Big Oh notation; (2) An imperative programming language; (3) Object oriented concepts.
Download or read it online for free here:
by Herbert Edelsbrunner - 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.
by Solomon I. Khmelnik - 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.
by Nashat Mansour - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
by Brad Miller, David Ranum - 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.