Library of Math
New and Used Math Books at Great Low Prices
Subscribe to the Library of Math Feed

Algorithms + Data Structures = Programs (Prentice-Hall Series in Automatic Computation)

Author: Niklaus Wirth
Publisher: Prentice Hall
Category: Book

List Price: $72.00
Buy Used: $3.33
You Save: $68.67 (95%)



New (3) Used (43) Collectible (2) from $3.33

Rating: 4.5 out of 5 stars 8 reviews
Sales Rank: 298444

Media: Hardcover
Pages: 366
Number Of Items: 1
Shipping Weight (lbs): 1.5
Dimensions (in): 9.5 x 6.5 x 0.8

ISBN: 0130224189
Dewey Decimal Number: 001.642
EAN: 9780130224187

Publication Date: February 1976
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: Dust Cover Missing. Millions of satisfied customers and climbing. Thriftbooks is the name you can trust, guaranteed. Spend Less. Read More.

Similar Items:

  • A Discipline of Programming (Prentice-Hall Series in Automatic Computation)
  • Algorithms and Data Structures
  • Software Tools
  • Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr)
  • The Design and Analysis of Computer Algorithms (Addison-Wesley Series in Computer Science and Information Processing)

Customer Reviews:   Read 3 more reviews...

5 out of 5 stars This is the book every programmer must read   July 22, 1999
9 out of 9 found this review helpful

This is the book every beginning programmer must read. Modern programmers know a lot about specific technical details, but they know nothing about effective algorithms. We're hiring new programmers now. We've tested a lot of folks with 5-8 years experience in Java. The result is nobody can implement basic operations with B-tree or combinatory algorithm. It's terrible. So read Niklaus Wirth if you want to be a serious programmer.


5 out of 5 stars A Necessary Block of a Programmer's Foundation   August 18, 2000
Peter N. Roth (Fairfax, VA USA)
8 out of 8 found this review helpful

With only five chapters and 365 pp, this text presents fundamental data structures, sorting, the best treatise I've found on recursion, dynamic information structures, and language structures & compilers. The date of the text precludes object-oriented programming, yet the tools presented here are welcome adjuncts for Delphi developers.


5 out of 5 stars A real gem...   March 17, 2006
Fernando Berzal Galiano (Granada, Spain)
7 out of 7 found this review helpful

It might seem completely dated with all its examples written in the now outmoded Pascal programming language (well, unless you are one of those Delphi zealot trying to resist to the Java/.NET dominance), but it is still highly recommended.

It is the single book I learnt most from when I was a freshman studying Computer Science at my local University (when Pascal was already declining, I'm not so old ;-). I wish more recent books were as good as this one, but I have not found a single book so focused and, at the same time, so broad in scope as this one.

Wirth covers programming fundamentals (including recursion), many sorting algorithms, data structures (from simple data collections to B-trees and hashing), and basic compiler technology. That is, four books into one (and, surprisingly, this is not a hefty tome.)



5 out of 5 stars A must have book   July 7, 2004
7 out of 8 found this review helpful

This book should be on the shelves of every computer science enthusiast and it does not hurt to read it once in a while to reestablish the foundations.


5 out of 5 stars This book needs to be reprinted!   July 17, 2000
CFB Software (Adelaide, Australia)
4 out of 4 found this review helpful

I bought this book back in 1982 and still refer to it for my current (Delphi) projects. It is a must for any programmer - beginner or professional who wants to write efficient algorithms.

 
about us contact us privacy policy terms of use mision statement lom help
The Library of Math - Online Math Organized by Subject Into Topics. © 2005 - 2008 www.LibraryOfMath.com All rights reserved. math rss