Books

Average customer rating:

slightly better than corman
great text
One of the better introduction algorithm books
Truly great book on algorithm design
Extremely Wordy

Algorithm Design
Jon Kleinberg , and Éva Tardos
Manufacturer: Addison Wesley
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books

General | Software Books | Custom Stores | Stores | Software
Similar Items:

Introduction to Algorithms
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Introduction to the Design and Analysis of Algorithms (2nd Edition)
Approximation Algorithms
Introduction to the Theory of Computation, Second Edition

ASIN: 0321295358

Book Description

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Customer Reviews:

slightly better than corman.......2007-06-11

best undergraduate handbook about algorithms i've seen so far.
examples are much less artificial than in cormen (introduction to algorithms)

great text.......2007-05-28

This is a great text as it teaches you the major techniques for designing efficient algortihms and how to solve real-life problems using algorithms rather than just presenting polished but inscrutable solutions to abstract problems

One of the better introduction algorithm books.......2006-12-10

With algorithms not a strength of mine (although I am a computer scientist student), I was quite happy that our professor switched to this book away from the MIT Press book. The first few chapters were exactly what I needed in order to finally get a grasp of key algorithm analysis and design concepts. As the book progressed to more difficult chapters, their explanations became less and less clear and seemed to rely more on text than on nice diagrams and graphics. A few complaints I have about the book: no mention of the Master Method in the dynamic programming chapter, NP-Complete explanation confusing, and no published errata that I could find. Although I have a few complaints about the book, it is one of the better books for being introduced to algorithms. It needs a little tuning now and then as some explanations are not so clear, but you'll find even more complicated explinations in other algorithm books.

Truly great book on algorithm design.......2006-03-18

I use this book in a course and I am immensely pleased with it. I must point out, though, that this is a very theoretical book. There is not much code and the authors use rather high-level psuedo code for what's there. However, it is great at explaining concepts and what the generic algorithms actually do. So it does its job quite brilliantly. If you need more code, you might want to pick up the Sedewick books, although the code could be better commented and organized if you asked me.

Extremely Wordy.......2005-09-15

This book is not concise; also the pseudocode syntax used in the book is annoying.

If you enjoy reading for the sake of reading then you might enjoy this book.There are better books out there by Knuth, Corman and Aho that cover the same topics as this one.

Average customer rating:

Fantastic algorithms book
Good Reference, Poor Textbook
Too much and too little
Great book with one major shortcoming
Great text, great reference

Introduction to Algorithms
Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein
Manufacturer: The MIT Press
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Operating Systems | Computers & Internet | Subjects | Books

General | Mathematics | Science | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books
Similar Items:

Artificial Intelligence: A Modern Approach (2nd Edition)
Introduction to the Theory of Computation, Second Edition
Operating System Concepts
Computer Organization and Design: The Hardware/Software Interface, Third Edition (The Morgan Kaufmann Series in Computer Architecture and Design) (The ... Series in Computer Architecture and Design)
Compilers: Principles, Techniques, and Tools (2nd Edition)

ASIN: 0262032937

Amazon.com

Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the math-averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems.

With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job of explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some math background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked lists to trees (including binary trees, red-black, and B-trees), this title really shines, with clear diagrams that show algorithms in operation. Even if you just glance over the mathematical notation here, you can definitely benefit from this text in other ways.

The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions.

This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials, and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveling salesman problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers.

Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome Project), business, and engineering. Each section ends with short discussions of related historical material, often discussing original research in each area of algorithms. On the whole, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more, with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, The Art of Computer Programming), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software. --Richard Dragan

Topics covered: Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions).

Book Description

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness.

The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

Customer Reviews:

Fantastic algorithms book.......2007-06-03

This is one of the few books that I've kept from my undergrad days as a computer science major. Although I haven't been doing software development in a while, I still use it for reference once in a while. It's easy to understand and timeless reference book. I work for a large DoD company and quite a few of my co-workers have this book on their shelves as well. (We all went to different colleges.)

Good Reference, Poor Textbook.......2007-04-19

This is a good reference for researchers, but it is not suitable for beginners. For anyone who try to study algorithms in the beginning, he just needs the big picture of this course, but this book contains too many mathematical proofs. In other words, the beginners just want a cup of milk, but the authors of this book give them a whole cow.

Although this book is quite huge, it does not contain some important topics, like online algorithms, randomized algorithms ... etc. In fact, this book should try to 'lose its weight' in order to get more useful knowledge.

The book contains a lot of interesting exercises, but does not indicate any hints or solutions. In fact, some of those exercises are too hard for students, and the authors should try to announce all sloutions in the website.

Too much and too little.......2007-03-02

+ Defacto standard
+ Accompanying WebCourse

- Too deep if used as an intro book; lacks solutions if used for a reference book
- It's HUGE!; hard to carry around

= Tries to appease too wide an audience. Definately attractive to professors who already know the information and feel this is THE book yet probably too deep for an intro algorithms class. Wish there was a searchable pdf version that came with the book on a CD as well as odd numbered solutions.

Great book with one major shortcoming.......2007-02-12

What it is:
A very thick text book about a) the mathematics behind algorithms, and b) a treasure chest of random performance tips.

Who it's for:
This book is for those who want or need to gain a decent grasp of the math for analyzing algorithms, and already have a decent understanding of discrete mathematics and probability.

What's good about it:
I really like this book. It's very high quality, well written, concise, and clear, and it's sprinkled with clever little tips to improve the efficiency of common routines.

Tips:
You can watch video recordings of the MIT lectures based on the book. Check out "6.046J Introduction to Algorithms" by searching for "ocw 6.046J" in your favorite search engine. The mathematical prerequisite course is also available in text form on MIT's OpenCourseWare; it can be found by searching for "ocw 6.042J spring 2005".

Warnings:
* Don't bother with this book unless you have a high aptitude for math
* Don't bother with this book unless you're prepared to work at it
* It's not designed as a reference book; instead it's a study book.

Many reviewers have called this book a "reference", but I have to disagree. A good reference book makes information quickly accessible, but this book would require you to read way too much to be called a reference. A practical reference book for algorithms is "The Algorithm Design Manual" by Steven S. Skiena, assuming you don't require proofs.

The Major Shortcoming!
Given that the book's design is most appropriate for learning things you don't already know, it has one major shortcoming: there are no answers to any of the exercises or problems. That makes the book semi-useless for self-study as well as for instructors who believe in the pedagogic value of students being able to check their answers. The instructor's manual is only available to instructors on the condition that they don't make the answers available.

Great text, great reference.......2007-02-10

The de facto standard for many algorithms courses. It's a great text with well-structured proofs, examples and exercises. It's also a great reference that I constantly find on the shelves of co-workers. Definitely a keeper that will come in handy for years to come.

Definitely not for those without a strong discrete math background. This book gives you the foundations and not just code.

Cheaper than the bookstores as always.

Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition

Average customer rating:

The unique and original applied cryptography book!
Easy to read, perfect level of detail.
Excellent Introduction
A must-have book for understanding Cryptography.
Prepare to drink from the firehose

Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition
Bruce Schneier
Manufacturer: Wiley
ProductGroup: Book
Binding: Paperback

General | Programming | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Amazon Upgrade | Amazon Upgrade | Stores | Books

Computers & Internet | Amazon Upgrade | Stores | Books

Professional & Technical | Amazon Upgrade | Stores | Books

Science | Amazon Upgrade | Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books

General | Software Books | Custom Stores | Stores | Software
Similar Items:

Practical Cryptography
Secrets and Lies: Digital Security in a Networked World
Beyond Fear
The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography
Handbook of Applied Cryptography (Crc Press Series on Discrete Mathematics and Its Applications)

ASIN: 0471117099

Amazon.com

Cryptographic techniques have applications far beyond the obvious uses of encoding and decoding information. For Internet developers who need to know about capabilities, such as digital signatures, that depend on cryptographic techniques, there's no better overview than Applied Cryptography, the definitive book on the subject. Bruce Schneier covers general classes of cryptographic protocols and then specific techniques, detailing the inner workings of real-world cryptographic algorithms including the Data Encryption Standard and RSA public-key cryptosystems. The book includes source-code listings and extensive advice on the practical aspects of cryptography implementation, such as the importance of generating truly random numbers and of keeping keys secure.

Book Description

". . .the best introduction to cryptography I've ever seen. . . . The book the National Security Agency wanted never to be published. . . ." -Wired Magazine

". . .monumental . . . fascinating . . . comprehensive . . . the definitive work on cryptography for computer programmers . . ." -Dr. Dobb's Journal

". . .easily ranks as one of the most authoritative in its field." -PC Magazine

". . .the bible of code hackers." -The Millennium Whole Earth Catalog

This new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography-the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems.

What's new in the Second Edition?
* New information on the Clipper Chip, including ways to defeat the key escrow mechanism
* New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher
* The latest protocols for digital signatures, authentication, secure elections, digital cash, and more
* More detailed information on key management and cryptographic implementations

Customer Reviews:

The unique and original applied cryptography book!.......2007-06-27

This book is extremely complete. It briefly covers the history of cryptography. It describes the political implications of cryptography and finally it shows how cryptography can be used in applications and presents the different cryptographic algorithms.

The algorithm section starts with a number theory primer.Honestly, I have found it a little bit too thin to learn all the needed background to fully understand the algorithms but on the other side, you cannot expect a simple 600 pages book to provide that background in the latest mathematical research number theories. It has at least the merit that it did stimulate my curiosity about number theory when I have read the first edition of this book.

Another point that makes this book interesting is that at the end of each chapter presenting the various algorithms in a given category, you will get Bruce Schneier opinion on which algorithm is the best. Of course, this type of information usually become outdated real fast but it is interesting to follow his thought process and test his predictions as the book grow older.

So, if you are looking for your first cryptography book, it should be this one.

Easy to read, perfect level of detail........2007-06-07

Great Book! The author's style makes this very easy to follow, and he frequently clarifies on topics which are difficult to grasp. Most importantly, he writes from a practical point of view; the material is very grounded and applicable instead of being a math textbook. That being said, he cites over 1600 sources; the book is riddled with leads to sources with more complete coverage for those interested in the fine details. Though I have some programming experience, I don't intend to write any programs; but it is interesting to read the logic in code. It was my goal to learn about modern cryptography and I have achieved that and much more.

Excellent Introduction.......2007-03-12

This book is now in the thirteenth reprinting of it's second edition with more than a hundred thousand copies sold. It is the definitive book on cryptography from the standpoint of a general overview of what sending secret messages is all about. It is not specifically oriented to the developer, but is more general in nature. There is not enough here for the mathematically inclined to seriously research the background of all the various systems.

As such consider this to be an introductory book on cryptography in general with a bit of history, a bit of story telling, an analysis of various cryptographic protocols and systems. There is source code provided for nine common protocols, and an invitation to order a three disk system that has source code for several more algorithms, functions, systems and additional text on various subjects. This disk set can only be sent to US and Canada addresses because of export rules on cryptographic information.

This is the definitive book on the subject. The only complaint I have is that it could stand to be done over in a third edition that would bring it more up to date.

A must-have book for understanding Cryptography........2006-03-11

This book has really shed a lot of light on cryptography for me. I honestly can't put it down--I wish I had paid more attention in my statistics classes so I could be able to apply some of the stuff the author talks about better. I am about half way through the book, and I haven't gotten to the point where it's more of a chore than a pleasure to read it (something I can't about my other technical books).
Glancing through the C source code at the end of the book started me thinking on the code implementation in my efforts - although I used Java althrough my life. I am not much comfortable with the C code because I was hoping for more goodie examples. If you want some practical guidance..you may little bit uncomforatble as well. At the end of the day if you are serious about Cryptography then you really need to get a copy of this.

Prepare to drink from the firehose.......2006-02-28

This book is really incredible. When it was first published in the mid-90's, there was almost no material available on the subject of cryptography. Now, ten years later, there are dozens, if not hundreds, of books riding on Schneier's coattails - but almost none have anything new or useful to say. Impeccably researched (with 1,653 references!) and unarguably complete, Schneier's expertise in theoretical mathematics, experience as a practitioner, and razor-sharp lucidity combine to make this the only book you'll ever need on the subject of cryptography.

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Average customer rating:

Just unnecessary
Another poorly written text book
Good Introductory Textbook

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Michael Mitzenmacher , and Eli Upfal
Manufacturer: Cambridge University Press
ProductGroup: Book
Binding: Hardcover

General | Computers & Internet | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Mathematical Analysis | Mathematics | Science | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books

Randomized Algorithms (Cambridge International Series on Parallel Computation)
Approximation Algorithms
Algorithm Design
The Probabilistic Method (Wiley-Interscience Series in Discrete Mathematics and Optimization)
Modern Graph Theory

ASIN: 0521835402

Book Description

Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains, MCMC, martingales, entropy, and other topics. The book is designed to accompany a one- or two-semester course for graduate students in computer science and applied mathematics.

Customer Reviews:

Just unnecessary.......2007-05-17

This book, while written by two renowned computer scientists, is truly disappointing. In trying to discuss randomness and computation, this book just does a mediocre job on discussing randomized computation and also an equally poor job discussing relevant aspects of probability theory. Their approach is not novel and many of their examples can be found in other texts. If you really want to learn randomized computation, get Motwani et al's book on Randomized Algorithms. If you want to learn probability theory, get any advanced probability theory book like Spencer and Alon on the probabilistic method, one of Sheldon Ross's books, or even Grimmett and Stirzaker. Whatever you do don't get this weak hybrid of a book that will require you to get another book at some point to supplement your understanding.

Another poorly written text book.......2006-03-19

The authors must be smart guys. They obviously understand alot about this subject but make the mistake that you do too! As a result, the book is inadequate as a teaching tool.

They use only half to a third of the narrative they need to adequately explain a subject. They also like to leave out proof steps or not explain them. The problems at the end of chapters are poor as well, since the authors seem to have forgotten to teach the techniques needed to solve most them in the chapter they belong to.

I am sure to them it is intuitive.

Good Introductory Textbook.......2005-03-16

It's pretty easy to get computers to do things where the answer is yes or no, or 4 or 6, given that the inputs to the problem are known. It's much harder to get an answer to a problem where the answer is that their is a 62% chance that the answer is yes. Unfortunately, in real life it's this second class of problems that predominates.

This book is oriented to solving these kinds of real world problems. The exercises in the book are chosen from real world examples -- what we used to call story problems. This tends to give the student a better understanding of not only the mathematics and programming involved but experience in looking at problems with a view to understanding this approach to solving the problem.

This book is suitable for a one or two semester introductory class at the upper undergraduate or beginning graduate level.

Just a word about the illustration on the front of the book. At the end of the book Alice in Wonderland the queen is about to order Alice beheaded. Alice says, "You're nothing but a pack of cards." At this, the whole pack rose up into the air and came flying down around her. This illustration is by John Tenniel from the original book of 1899. A deck of flying playing cards is a good way to illustrate random and probability.

Average customer rating:

very nice conceptual overview
Not for the practitioner
Trash
Excellent Introduction, Sparse on Details
A Good Introductory Survey

Scientific Computing
Michael T Heath , and Michael Heath
Manufacturer: McGraw-Hill Science/Engineering/Math
ProductGroup: Book
Binding: Hardcover

General | Computers & Internet | Subjects | Books

Research | Education | Science | Subjects | Books

Methodology & Statistics | Experiments, Instruments & Measurement | Science | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

General | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

Algorithms | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

Numerical Computing with Matlab
Numerical Analysis: Mathematics of Scientific Computing
Financial Risk Management: A Practitioner's Guide to Managing Market and Credit Risk (with CD-ROM)
Algorithm Design
Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition)

ASIN: 0072399104

Book Description

Heath 2/e, presents a broad overview of numerical methods for solving all the major problems in scientific computing, including linear and nonlinear equations, least squares, eigenvalues, optimization, interpolation, integration, ordinary and partial differential equations, fast Fourier transforms, and random number generators. The treatment is comprehensive yet concise, software-oriented yet compatible with a variety of software packages and programming languages. The book features more than 160 examples, 500 review questions, 240 exercises, and 200 computer problems. Changes for the second edition include: expanded motivational discussions and examples; formal statements of all major algorithms; expanded discussions of existence, uniqueness, and conditioning for each type of problem so that students can recognize "good" and "bad" problem formulations and understand the corresponding quality of results produced; and expanded coverage of several topics, particularly eigenvalues and constrained optimization. The book contains a wealth of material and can be used in a variety of one- or two-term courses in computer science, mathematics, or engineering. Its comprehensiveness and modern perspective, as well as the software pointers provided, also make it a highly useful reference for practicing professionals who need to solve computational problems.

Customer Reviews:

very nice conceptual overview.......2006-07-22

Wow, people seem to be really split on this book. I had Mike Heath for numerical analysis/scientific computing and he was an excellent instructor, one of the best lecturers I've ever had. (As a consequence, I have a hard time separating the book and the class, so judge accordingly.) The book is based on his lecture notes, though he added some material and didn't cover every topic in the book. Just reading the book is useful to give you an overview of the point behind different methods. The goal of the class for which this book was written is actually quite conceptual. It was to give scientists (that's me: a stats researcher who makes heavy use of numerical computation) and CS people in areas other than scientific computing a leg up. It was only a first class for people in scientific computing, the rough equivalent of intro Physics or intro Probability/Stats for people in those respective majors. However, you *won't* be prepared to "roll your own" from this book. In fact, at the beginning of the semester Heath was very careful to note that if you have the opportunity to use a library function for most numerical programming, you are nuts to roll your own. Why? Numerical algorithms are usually extremely complicated and the authors of the code often spend years developing careful expertise on them. Frequently the formulas used to elucidate a given method are NOT the ones used to implement it. You need error traps, tricks to handle ill-scaling and other special cases, etc. These are things that someone who has a one-semester, superficial understanding of a topic simply won't have. So consider the book on the goals it set: it is an overview of a field. If you want to learn more about any one topic, you have to dig deeper and consult references and other works, but this is a good place to start. For this, the book serves admirably.

Not for the practitioner.......2005-11-17

If you are interested in Scientific computing from the viewpoint of the end user that is the guy who uses the method to solve practical engineering problems then this book is lacking.

Not enough methods in this book to constitute an introductory survey of the field. Every chapter gets heavy dose mathematical treatment, apparently Heath loves his math but for the rest of us it doesnt translate into know-how. Know how to solve equations using computational techniques. Very few derivations to back his mathematical swagger, very few examples (if any) and fewer numerical schemes to solve problems. Many of the chapters receive cursory treatment such as PDE's get about 70 pages of print. Far too little to do anyone any good.

He does talk about interesting issues such as conditioning and error analysis and computer precision and memory issues but it is done from such a superficial viewpoint that one cannot use anything to improve ones code. Not recommended if you want to learn numerical methods even if you have an excellent professor to learn from. His chapter on FFT's was even more abstruse and there was hardly any methods with which to solve PDE's.

I had this for a graduate course in Numerical Methods but ended up using Hoffman's excellent book on Numerical Methods.

Trash.......2005-10-14

If you want to have a solid understanding of numerical computation, this book is definitely the last choice. Many theorems are given without any proof or even intuitions behind them in this book. Even when a proof is provided, it's often far from rigorous. The organization of chapters is the worst I have ever seen, revelant materials are scattered over several different locations rather than put together. Take the SVD for example, it is mentioned in the end of chapter 3, but reappears in chapter 4, which is very confusing. If you are new to this area, please don't read this book. It gives you many many facts without explanations, which I think is not a good way to learn new things. David S. Watkins' Fundamentals of Matrix Computations is a lot better and easier to understand. It also emcompasses many detailed treatments of various theorems. If you have bought Heath's book, don't be sad, at least it can serve as a coaster.

Excellent Introduction, Sparse on Details.......2004-11-20

While sparse on the details of many of the algorithms and theorems mentioned, as an introduction it covers a broad range of material-enough for two semesters of study. The writing is lucid, and when a proof of a theorem is given, it is easy to follow and explained in english afterward. Rationale is given for everything, which is a great benefit to a student not familiar with the nuances of sophisticated linear algebra.

A Good Introductory Survey.......2002-11-05

This book excels at presenting a reader with little to no knowledge in computer science and a mild mathematical background (knowledge of differential equations as a prerequisite) with the fundamental concepts regarding scientific computing. The presentation of pseudo-code algorithms helps smooth the transition from analytical (pencil and paper) thinking to numerical thinking. The algorithms are presented in a manner such tha anyone with access to dozens of possible environments can apply them, though they are by no means complete, thus requiring some thought into the processes. The material covered is 110% of what an engineer will want to know, 90% of what an applied mathematician will want to know, and 45% of what a numerical analyist will want to know. In all, a great book to begin a foray into numerical computing.

Average customer rating:

Optimization Mini-Library
It's not the technique, it's the logic behind it
improve your problem solving ability
get this book!, read it!, understand it! :)
Best book on problem solving

How to Solve It: Modern Heuristics
Zbigniew Michalewicz , and David B. Fogel
Manufacturer: Springer
ProductGroup: Book
Binding: Hardcover

General | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

Look Inside Art Books | Trip | Specialty Stores | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Amazon Upgrade | Amazon Upgrade | Stores | Books

Computers & Internet | Amazon Upgrade | Stores | Books

Professional & Technical | Amazon Upgrade | Stores | Books

Science | Amazon Upgrade | Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books

General | Software Books | Custom Stores | Stores | Software
Similar Items:

How to Solve It: A New Aspect of Mathematical Method (Princeton Science Library)
An Introduction to Genetic Algorithms (Complex Adaptive Systems)
Ant Colony Optimization (Bradford Books)
Genetic Algorithms in Search, Optimization, and Machine Learning
Combinatorial Optimization: Algorithms and Complexity

ASIN: 3540224947

Book Description

This book is the only source that provides comprehensive, current, and correct information on problem solving using modern heuristics. It covers classic methods of optimization, including dynamic programming, the simplex method, and gradient techniques, as well as recent innovations such as simulated annealing, tabu search, and evolutionary computation. Integrated into the discourse is a series of problems and puzzles to challenge the reader. The book is written in a lively, engaging style and is intended for students and practitioners alike. Anyone who reads and understands the material in the book will be armed with the most powerful problem solving tools currently known.

This second edition contains two new chapters, one on coevolutionary systems and one on multicriterial decision-making. Also some new puzzles are added and various subchapters are revised.

Customer Reviews:

Optimization Mini-Library.......2007-02-20

This is the best book I have in my optimization library. It is excellent for students and teachers as well. It introduces you to optimization using a simple language, practical examples explained in a very didactical manner. It surveys optimization techniques and categorizes it in a very well-arranged and simplified format. You wouldn't have to read tens of pages with unsightly symbols, messed with subscripts and superscripts to understand a single optimization technique.
It also brings an uplifting introduction to the concept of problem solving. I highly recommend this book to Optimization and Mathematics students and teachers.
Read the book, once you are done, look at the table of contents and give a five minutes lecture on each single title and subtitle, which is what you will be capable of doing at the end.

It's not the technique, it's the logic behind it.......2006-07-24

Most evolutionary computation or math books deal with the techniques of solving problems. This book teachs you how to think of a solution for the problem you face, and not what problems are appropriate for the technique in hand.

The logic is that when you do a craft work, you do pick the appropriate tool from your tools box, but you don't grasp a tool and then find a job to go with it, which is the case when you can only handle this tool.

improve your problem solving ability.......2006-02-20

The authors have updated their successful first edition, though the latter, printed in 99, was scarcely obsolete. A heuristic can be basically a rule of thumb, dressed up in fancier language. What the authors intend is for you to develop an intuition about when to use modern algorithms. Where is almost every case, these are actually implemented on a computer; a reflection of the cheap availability of computing power to most readers.

The book is a good complement to various standard algorithm texts, like those by Sedgewick, Aho and Knuth. You can consider this book as standing a level above those. [Though Knuth's books also do an excellent job of suggesting when to use or modify algorithms. ]

The level of discussion here is not of a strict, heavy mathematical approach. It can be read as informal guidelines, that discuss the gist of such ideas as simulated annealing and evolutionary methods. There is a wide range of example problems, to motivate you in understanding what might be used to solve them.

get this book!, read it!, understand it! :).......2006-01-01

i have not finished reading this book, but it's 'worth it' if only for the first two chapters! :) anyone interested in dynamical systems (control aspects), general problem solving, AI, and human thinking should read and understand this book! :) work the problems! :) think! enjoy! :)

Best book on problem solving .......2005-12-04

This is simply the best book on computer problem solving that I've seen. I have both editions. The second is expanded from the first with new material on things like multicriteria decision making. The book's engaging tone is matched by a detailed understanding of all the different approaches to problem solving that are offered. The text emphasizes evolutionary computing but offers complete treatments of other optimization methods, although there are only single chapters on neural nets or fuzzy logic. Most importantly, it does so in a way that no other book I've seen does -- it makes it fun and it makes you think! I saw that another reviewer said the book got great classroom reviews. I don't doubt it. I wish there was a book like this when I was in college.

Data Structures and Algorithms in Java, Second Edition

Average customer rating:

Excellent book for data structures using java

Data Structures and Algorithms in Java, Second Edition
Adam Drozdek
Manufacturer: Course Technology
ProductGroup: Book
Binding: Hardcover

Database Design | Databases | Computers & Internet | Subjects | Books

General | Databases | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

Modeling & Simulation | Computer Science | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books

General | Software Books | Custom Stores | Stores | Software
Similar Items:

Data Structures & Algorithms in Java (Mitchell Waite Signature Series)
The Essentials of Computer Organization And Architecture
Data Structures and Algorithms in C++, Third Edition
Discrete Mathematics with Graph Theory (3rd Edition)
Data Structures and Algorithms in Java (2nd Edition)

ASIN: 0534492525

Book Description

Using the Java programming language, author Adam Drozdek highlights three important aspects of data structures and algorithms.

Customer Reviews:

Excellent book for data structures using java.......2000-10-05

I was looking for a latest edition of a book on data structures using Java. Lafore, Martin etc. are good texts but since collection API has introduced in jdk 1.2, those books seems to be obsolete. This book discusses new API and classes provided by java environment, so we need not to be bogged down by writing the unnecessary code. I feel this book is good for professionals in the industry as well as students of computer science. Algorithms are dealt with in detail with all the mathematical proofs involved, regarding efficiency and complexity. Various data structures are discussed with sufficient number of examples. Its a language specific book on data structures and algorithms, so if you are looking for a general book ar if you are working with any other language you will be dissappointed but surely a good book for java programming language.

Average customer rating:

Encyclopedia of Optimization

Manufacturer: Springer
ProductGroup: Book
Binding: Hardcover

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Reference | Mathematics | Science | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books
ASIN: 0792369327

Book Description

Optimization problems are widespread in the mathematical modeling of real world systems and their applications arise in all branches of science, applied science and engineering. The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics in order to show the spectrum of recent research activities and the richness of ideas in the development of theories, algorithms and the applications of optimization. It is directed to a diverse audience of students, scientists, engineers, decision makers and problem solvers in academia, business, industry, and government.

Practical Introduction to Data Structures and Algorithms, Java Edition

Average customer rating:

The gears on the cover dont even work!
Anonymous
Very unhelpful book
I normally buy books because they contain information...
Bad Book

Practical Introduction to Data Structures and Algorithms, Java Edition
Clifford A. Shaffer
Manufacturer: Prentice Hall
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Databases | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

Data Structures | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

Programming Languages | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

General | Software Books | Custom Stores | Stores | Software
Similar Items:

Fundamentals of Database Systems (5th Edition)
Database Systems Using Oracle (2nd Edition)
Operating System Concepts
Elementary Linear Algebra with Applications
Introduction to Computing Systems: From bits & gates to C & beyond

ASIN: 0136609112

Book Description

The author, Cliff Shaffer provides a superior learning tool for those who desire more rigorous data structures and an algorithm analysis book utilizing Java. While the author covers most of the standard data structures, he concentrates on teaching the principles required to select or design a data structure that will best solve a problem. The emphasis is on data structures, and algorithm analysis, not teaching Java. Java is utilized strictly as a tool to illustrate data structures concepts and only the minimal, useful subset of Java is included.

Customer Reviews:

The gears on the cover dont even work!.......2006-03-21

I have Dr Shaffer as my professor and he is just as boring in real life as his book. He has told us that some of the code segements are broken to make his students figure them out. DONT buy this book... It's not worth the money.

Anonymous.......2006-02-15

I would not reccomend this book for learning about data structures. With incomplete code and scampy sections on core area material, it seems to serve more as a workbook than anything else. In addition to this I find it to be poorly worded which has often caused me to overlook important details or have to read a sentence multiple times to understand what the author is saying. What saves this from being a one star product is the fact that if you do know the material, it can help you review structures but even then, the ackward wording still can slow down a quick read.

Very unhelpful book.......2005-11-29

Dr. Shaffer attempts to address the difficult topic of data structures and fails. Consistently he glosses over important points, or does not describe the implementation of data structures (the buffer pool, for example, is especially poor) adequately and leaves the hapless student confused and frustrated. For a computer scientist who already understands the subject this book may contain a few good points. Indeed, I was able to follow the sections where I had previous training, but when I studied material new to me, I was out of luck.

If you are unlucky enough to have a university that uses this text, consider trying to find a better book to get yourself an adequate understanding of this important subject, because Dr. Shaffer's text won't do that for you.

I normally buy books because they contain information..........2004-11-05

...but this was a mandatory book for my university's two-course Data Structures & Algorithms sequence that all computer scientists and computer engineers must take.

Coming in with a good deal of programming experience, I find that this book is not as clear or as complete as it could be. The sample code snippets throughout tend to be awkwardly implmented with obscure variable names and obtuse datatyping, and more often than not represent 'a' way of accomplishing a task rather than 'the best' way. Finding better ways of doing things is normally left for exercises at the end of the chapter; the answers are not included with the book.

Also, many significant details or comments are skimmed over or are ommitted from the text. Many important (and complex) observations are left as exercises - but again, the answers are not included, so there is no way of validating your answers.

Further, this book is targeted at the C++ language. It is obscene to discuss data structures and algorithms without mentioning the free, prepackaged, and optimized code of the C++ Standard Template Library. Indeed, this book and the code it includes would have benefitted from the ingenious architecture and software engineering behind the STL.

I really hope the campus bookstore will buy this one back when I'm done with it.

Bad Book.......2004-01-28

I was required to get this book for my CS344 class and so far I don't like this book at all. The exercises at the end of each chapter aren't good problems. Don't get it unless, like me, you have to.

Average customer rating:

Not a self-study tool
Worst Textbook I've Ever Used
I would give it 0 stars if I could
The worst DSA book ever written!
Yaovamaln

Data Structures and Algorithms in C++
Michael T. Goodrich , Roberto Tamassia , David M. Mount , and David Mount
Manufacturer: Wiley
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Databases | Computers & Internet | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Qualifying Textbooks - Spring 2007 | Stores | Books
Similar Items:

Essentials of Computer Architecture
Programming With GNU Software
Operating Systems: Internals and Design Principles (5th Edition)
Vector Calculus
Introduction to Algorithms

ASIN: 0471202088

Book Description

* Provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation
* Each data structure is presented using ADTs and their respective implementations
* Helps provide an understanding of the wide spectrum of skills ranging from sound algorithm and data structure design to efficient implementation and coding of these designs in C++
Wiley Higher Education

Customer Reviews:

Not a self-study tool.......2005-12-23

This book is very bad unless you have a good teacher to supplement. I used this book only to understand concepts that I wasn't clear on during the class lectures. In short, a horrible book if you want to self-teach but not too bad if you just want it as a supplement.

Worst Textbook I've Ever Used.......2005-12-05

This is honestly one of the worst if not the worst textbooks i have ever used. I am a computer science major at the University of Buffalo and was required to use this book for a course with the same name. This book is full of useless examples that demonstrate the easiest of concepts while there are huge holes in coverage of harder concepts in the book. The end of the chapter exercises are terrible and are not explained in the chapters preceding them. Stay away from this text.

I would give it 0 stars if I could.......2005-07-24

This is a very frustrating book. The writing is horrible, there are no sample exercises in the book so when you go to do an assignment from the exercises, there is no example of how to approach the problem. There is a "hint database" on their online website that gives you one line of how to approach a problem, but even that is hit or miss and can make things even more confusing. In short, I didn't learn any more about data structures than I didn't already know from my previous courses.
If you are looking for a book that explains things in a much better format, look for the Data Structures and Algorithm Analysis in C++ by Weiss. It explains things so much better.
Don't waste your money on this, and if you have to buy it for a class, definitely buy used. I'm selling mine back to the school bookstore!!

The worst DSA book ever written!.......2005-03-02

This is one of the dozens of Data Structures and Algorithms books in the market and till now the worst I've ever seen. I have taken two DSA courses in my undergrad years, and now as a grad, I'm TAing that course.

The theoretical treatment of the book is superficial and too childish. Yet, there's too little practical value. They discuss the unnecessary linked list implementations of trees which is quite confusing for students. I am also amazed that they do not mention finding or removing an element in a BST. And, more importantly there's too little discussion of graphs.

I don't understand those professors trying to bog down students with useless details and complicated C++ codes. Rather, they should give the intuition and the theory behind the data structures and algorithms. Weiss' book is much better than this one. But, even that is obsessed with doing tricky things with C++.

Anyway, to sum up: This book is a garbage. Stay away unless it's required for the course you're taking in case you may need to do homeworks and such.

Yaovamaln.......2004-06-04

Good concept but you can't get enough. It is very difficult to follow as the authors provides Code fragments. I don't think this is suitable for self-study.

Books:

Books