Showing posts with label data structures. Show all posts
Showing posts with label data structures. Show all posts

Handbook of Data Structures and Applications (Chapman & Hall/CRC Computer & Information Science Series) Review

Handbook of Data Structures and Applications (Chapman and Hall/CRC Computer and Information Science Series)
Average Reviews:

(More customer reviews)
This is a very useful book to have. It looks to me that the book is a compilation of various research papers by different authors. Provides a unique view to Data structures and their applications.

Click Here to see more reviews about: Handbook of Data Structures and Applications (Chapman & Hall/CRC Computer & Information Science Series)

Although there are many advanced and specialized texts and handbooks on algorithms, until now there was no book that focused exclusively on the wide variety of data structures that have been reported in the literature. The Handbook of Data Structures and Applications responds to the needs of students, professionals, and researchers who need a mainstream reference on data structures by providing a comprehensive survey of data structures of various types.Divided into seven parts, the text begins with a review of introductory material, followed by a discussion of well-known classes of data structures, Priority Queues, Dictionary Structures, and Multidimensional structures. The editors next analyze miscellaneous data structures, which are well-known structures that elude easy classification. The book then addresses mechanisms and tools that were developed to facilitate the use of data structures in real programs. It concludes with an examination of the applications of data structures. The Handbook is invaluable in suggesting new ideas for research in data structures, and for revealing application contexts in which they can be deployed. Practitioners devising algorithms will gain insight into organizing data, allowing them to solve algorithmic problems more efficiently.

Buy NowGet 21% OFF

Click here for more information about Handbook of Data Structures and Applications (Chapman & Hall/CRC Computer & Information Science Series)

Read More...

Database Systems Concepts with Oracle CD Review

Database Systems Concepts with Oracle CD
Average Reviews:

(More customer reviews)
This book is a requirement for a course that I am taking. The book is riddled with errors. You can randomly open any page from the book- and you will find typos and confusing text. On some pages, the powerpoint slides for the book do not even match with the text of the book. This is the sixth edition of this textbook. I consider it inexcusable that the book has hundreds of typos even after being published for more than ten years. As another reviewer pointed out, the additional material that is needed for the book -like SQL schemas- do not even exist in the book's website- contrary to what the book claims. Anybody who is considering this book should think twice. Please get it from the library - go through the book for a week to see what I mean- and dump the book for any book that should be better than this.

Click Here to see more reviews about: Database Systems Concepts with Oracle CD

The Fourth edition of Database System Concepts has been extensively revised from the 3rd edition. The new edition provides improved coverage of concepts, extensive coverage of new tools and techniques, and updated coverage of database system internals. This text is intended for a first course in databases at the junior or senior undergraduate, or first-year graduate level. Database System Concepts, 4th ed. offers a complete background in the basics of database design, languages, and system implementations. Concepts are presented using intuitive descriptions, and important theoretical results are covered, but formal proofs are omitted.The fundamental concepts and algorithms covered in Database System Concepts 4th ed. are based on those used in existing commercial or experimental database systems.The authors present these concepts and algorithms in a general setting that is not tied to one particular database system.

Buy Now

Click here for more information about Database Systems Concepts with Oracle CD

Read More...

Fundamentals of Data Structures in C++ Review

Fundamentals of Data Structures in C++
Average Reviews:

(More customer reviews)
This book treats the subject of algorithm analysis and data structure with great formalism. This book, in my view, is a must for any under grad course. This book lays foundation for a career in systems programming. However, if you only have passing interest in computer science, this is not a book for you.
sunil@liberate.com

Click Here to see more reviews about: Fundamentals of Data Structures in C++



Buy Now

Click here for more information about Fundamentals of Data Structures in C++

Read More...

Data Structures and the Standard Template Library Review

Data Structures and the Standard Template Library
Average Reviews:

(More customer reviews)
Paid about $100 dollars for this book only to find more bugs than a rainforest; frustrating since the author teaches at the university level but the code resembles that of a novice programmer.
Do yourself a favor and go with another book. You're literally better off
crumpling your cash money and throwing it in the trash rather than buying this disappointment.

Click Here to see more reviews about: Data Structures and the Standard Template Library



Buy Now

Click here for more information about Data Structures and the Standard Template Library

Read More...

Data Structures and the Java Collections Framework Review

Data Structures and the Java Collections Framework
Average Reviews:

(More customer reviews)
Almost three years ago I read a data structures book which used Java for implementation of the topics covered. Perhaps I did not have a solid grasp of the Java language back then, but the book was one of the worst I have come across - I don't even remember the name. "Data Structures and the Java Collections Framework" on the other hand is one of the most up-to-date books available and certainly one that I will remember for quite some time.
Not only does it cover the theory behind many of the fundamental data structures such as arrays, stacks, queues, trees, graphs, maps, etc. but it also illustrates common algorithms required by those data structures. For a book covering this kind of material that would have been enough, but this book excels in showing implementations with the latest version of Java.
Furthermore, this book's purpose is not to teach Object Oriented programming with Java, or the latest features of version 1.5 (Generics, foreach loop, boxing, vararg). The author assumes those were taught in an introductory Java course. Thus, the book does accomplish its goal to teach data structures using Java, and taking advantage of OO design and the latest features of the language. And for those who need a quick refresher two review chapters are included that quickly cover the most commonly used features of Java, as well as javadoc and packages.
As many other technical books, this one contains its share of typos and errors - nothing major though. Later in the book, only parts of the entire implementation of certain data structures are presented, but yet there is no mention that the book's website contains that and more. Also, an introduction to JUnit could have made this book better.
The part that readers will find most useful about Mr. Collins' book is the future applicability of the Java Collections Framework. There are many poorly written books that deal with data structures and books about the Collections Framework. And yet this book does an outstanding job with the two subjects. A great book to learn data structures from - Highly recommended.


Click Here to see more reviews about: Data Structures and the Java Collections Framework



Buy Now

Click here for more information about Data Structures and the Java Collections Framework

Read More...

Data Structures & Algorithms in Java with CDROM (Mitchell Waite Signature) Review

Data Structures and Algorithms in Java with CDROM (Mitchell Waite Signature)
Average Reviews:

(More customer reviews)
I am surprised that most instructors haven't banned this book! It is absolutely one of the best data structures references on the market and with answers provided with the enclosed CD, one perfect "cheat book." Virtually all the standard data structures for an introductory DS&A course are included here with a good explanation behind the rationale used in the implementation of the code. Lafore is a good writer and explains things well, unlike certain authors. The book isn't heavy on the mathematics, which is good for programmers who don't want to get involved with theory. The applets which implement the data structures are particularly nice.
As mentioned in a previous review, trees are not covered well in this book, but most introductory books don't cover them well either. I don't expect to see an analysis of AVL or red-black trees in an introductory book (Cormen's text, which is the standard for grad school, doesn't explain trees well either). In fact, only Schaffer's book does a creditable job of explaining AVL trees but the implementation of the code isn't the greatest. But for linked lists, stacks,queues, and the like, there are few books that are the equal of this one. Buy the book and you'll pass your DS&A class with flying colors!

Click Here to see more reviews about: Data Structures & Algorithms in Java with CDROM (Mitchell Waite Signature)

Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs, called "Workshop Applets," are provided with the book. These Workshop Applets provide interactive "moving pictures" which the user can control and modify by pressing buttons. The books text describes specific operations the user can carry out with these Workshop Applets, and the applets then reveal the inner workings of an algorithm or data structure.

Buy Now

Click here for more information about Data Structures & Algorithms in Java with CDROM (Mitchell Waite Signature)

Read More...

C++ Plus Data Structures Review

C++ Plus Data Structures
Average Reviews:

(More customer reviews)
I've been in college as teacher and student for almost 40 years, and this is one of the most soul-destroying textbooks in any field I have studied.
When introducing fundamentals, the authors often express themselves poorly and try to compensate through repetition and paraphrase. This confuses the student fresh to the material, since it is not clear whether the same point is being repeated, or developed, or a new one introduced. On the other hand, they simply skirt concepts--exception handling, for example--that need to be explained in detail. Instead of straightforwardly presenting new material, they tiptoe around it through constructs of their own design which are no more easy to learn and whose relation to the essential point is unclear. For example, something like myNode->next->back refers to the node pointed to by the back pointer of the node following myNode, i.e. to myNode itself. Not too mind-boggling. But first they have to lead us through a song and dance about a notation they invented which represents the preceding as back(next(myNode)), which is (a) unnecessary, (b) more complex, and (c) really confusing because (a) it is exactly backwards, and (b) the most deeply nested item is one that dominates the structure. The whole book is like this, a weird combination of aimlessness with a hidden agenda, expressed in patronizing, humorless, finger-wagging.
Other reviewers call it a good reference work; it is not. It is poorly indexed, partly because the explanation of a single concept may appear at intervals through several chapters of context which, though rambling, is a necessary to grasp the meaning.
Note that the enthusiastic reviews of this book come from a software reviewer, someone who finds this the clearest of the _three_ data structure books he's used, and someone who recommends it to advanced programmers, granting that you have to understand C++ classes to follow the book--although the book's task is to _introduce_ C++ classes. Another says that all previous courses just taught C++ coding--but this is a second-semester text! In other words, it's a great book to own if you don't need it.
I think teachers who like this book don't actually read it, just flip through it, checking points, "Lists, yup, linked lists, yup, doubly-linked lists, with circles and arrows on the back, yup, yup, yup, it's all there," because THEY DON'T HAVE TO LEARN ANYTHING FROM IT. I can't see how any teacher could adopt it who tried to read it from the point of view of someone new to the material presented.

Click Here to see more reviews about: C++ Plus Data Structures

C++ Plus Data Structures is designed for a course in Data Structures w here C++ is the programming language. The book focuses on abstract dat a types as viewed from three different perspective: their specificatio n, their application, and their implementation. The authors stress co mputer science theory and software engineering principles, including m odularization, data encapsulation, information hiding, data abstractio n, object-oriented decomposition, functional decomposition, the analys is of algorithms, and life-cycle software verification methods. Final ly, through classic Dale pedagogy students are offered a clear, easy-t o-understand discussion of important theoretical constructs and their implementation in C++.

Buy Now

Click here for more information about C++ Plus Data Structures

Read More...

Classic Data Structures in C++ Review

Classic Data Structures in C++
Average Reviews:

(More customer reviews)
Keep this book on your shelf for a long time, you'll look back to it often. The exmaples use STL (standard templete library) so you don't have to worry about the code being useless when it comes to your data struct. Lastly, don't be intimidated by this book; accessible to both the beginner and expert.

Click Here to see more reviews about: Classic Data Structures in C++



Buy Now

Click here for more information about Classic Data Structures in C++

Read More...

Algorithms and Data Structures in C++ (Computer Science & Engineering) Review

Algorithms and Data Structures in C++ (Computer Science and Engineering)
Average Reviews:

(More customer reviews)
The formulas of (1.3), (1.4), (1.5),(1.6) are all wrong!
Can't believe it, four formulas in first page are all have errors. Maybe the author fell so sleepy when he's writing this book!

Click Here to see more reviews about: Algorithms and Data Structures in C++ (Computer Science & Engineering)

Algorithms and Data Structures in C++ introduces modern issues in the theory of algorithms, emphasizing complexity, graphs, parallel processing, and visualization. To accomplish this, the book uses an appropriate subset of frequently utilized and representative algorithms and applications in order to demonstrate the unique and modern aspects of the C++ programming language. What makes this book so valuable is that many complete C++ programs have been compiled and executed on multiple platforms. Each program presented is a stand-alone functional program. A number of applications that exercise significant features of C++, including templates and polymorphisms, is included. The book is a perfect text for computer science and engineering students in traditional algorithms or data structures courses. It will also benefit professionals in all fields of computer science and engineering.

Buy Now

Click here for more information about Algorithms and Data Structures in C++ (Computer Science & Engineering)

Read More...

Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Worldwide Series in Computer Science) Review

Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Worldwide Series in Computer Science)
Average Reviews:

(More customer reviews)
Not to bad. The book is a little high in price, but covers a large set of algorithms that could be applied to many Java applications. The book reads like a algebra book, with lots of formulas and theory and with not enough examples. Not for light reading.

Click Here to see more reviews about: Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Worldwide Series in Computer Science)

Create sound software designs with data structures that use modern object-oriented design patterns! Author Bruno Preiss presents the fundamentals of data structures and algorithms from a modern, object-oriented perspective. The text promotes object-oriented design using Java and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy. This framework clearly shows the relationships between data structures and illustrates how polymorphism and inheritance can be used effectively. Key Features of the Text* All data structures are presented using a common framework. This shows the relationship between the data structures and how they are implemented.* Object-oriented design patterns are used to demonstrate how a good design fits together and transcends the problem at hand.* A single Java software design is used throughout the text to provide a better understanding of the operation of complicated data structures.* Just-in-time presentation of mathematical analysis techniques introduces students to mathematical concepts as needed.Visit the Text's Web Site A comprehensive web site is available for users of the text at www.wiley.com/college/preiss. The site includes:* The Web Book (a hypertext version of the complete book)* Links to the Java Source Code (all the program examples from the text)* Opus5 Package (a Java package comprised of all the source code from the text)* Documentation (source code documentation)* Demo Applets (various Java applets that illustrate data structures and algorithms from the text)* Archive (JAR format archive of the source code from the text)* Front Matter (table of contents and preface)* Solutions Manual (password required)* Errata

Buy Now

Click here for more information about Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Worldwide Series in Computer Science)

Read More...

Data Structures and Algorithms with Object-Oriented Design Patterns in C++ Review

Data Structures and Algorithms with Object-Oriented Design Patterns in C++
Average Reviews:

(More customer reviews)
Believe the summary...this book is for 2nd and 3rd year post-secondary students. I am an experienced C++ programmer, but Grade 12 math isn't enough to cut through the explanations to get to the code, which I can understand perfectly well.
Who should buy this book? Students with a good grasp of basic calculus, who want a thoroughly academic treatment of algorithms in C++ in order to pass Computer Science.
Who should not? A C++ programmer that wants clear, effectively presented information on implementing standard algorithms and data structures in order to get their project done.
I'm of the Keep It Simple school of thought, and the practical theory and implementations in this book could have been presented much more effectively without the adademic bafflegab.
I am currently working on my calculus skills in my spare time, and as my familiarity with the mathematical notation grows, I may be able to put this book to good use. Untill then I wish I'd bought something else, programming doesn't need to be as dense as this book makes it.

Click Here to see more reviews about: Data Structures and Algorithms with Object-Oriented Design Patterns in C++

An object-oriented learning framework for creating good software design.Bruno Preiss presents readers with a modern, object-oriented perspective for looking at data structures and algorithms, clearly showing how to use polymorphism and inheritance, and including fragments from working and tested programs.

Buy Now

Click here for more information about Data Structures and Algorithms with Object-Oriented Design Patterns in C++

Read More...

Data Structures: A Pseudocode Approach with C Review

Data Structures: A Pseudocode Approach with C
Average Reviews:

(More customer reviews)
I had to buy this book for a computer science course. Thankfully I got a refund on it when I tested out of the course two weeks later. For those who are forced to learn the contents of this book, here is what to expect, as I read the entire book.
Since I was already very familiar with most concepts ( ie. actually programmed them ), I have to say that no book has made me more confused or angry than this one. Ideas that are simple are obscured with inappropriate examples / wordings, so I actually had to read many paragraphs TWICE, to get the point of the author. Even the pictures are far from refined, and the presentation is quite amateur. There were several times I just wanted to throw the book at the wall in disgust.
As a first (and unbelievable) example, from page 2 you are given the "Commandments" of good Pseudocode. One such rule is never to use identifiers such as 'i' or 'j', as they should instead be given an 'english' name such as 'student'. On page 6, we have the first code example, where they proceed to use 'i' and 'j' within the code. Then they explain that, oh yes, 'i' and 'j' is actually a loop tradition in C++! So we're already confused! By page 6. Now, the beautiful thing is that you can read this for yourself right now, with Amazon's page excerpts. This sets the level of presentation for the rest of the book.
My apologies to those who may like this book, but please take time to explore other books before this one. Programming is far easier than is explained in this book. At this level of programming development, a bad experience can be most discouraging. And this book is very, very bad.

Click Here to see more reviews about: Data Structures: A Pseudocode Approach with C

This second edition expands upon the solid, practical foundation established in the first edition of the text. A new four-part organizational structure increases the flexibility of the text, and all material is presented in a straightforward manner accompanied by an array of examples and visual diagrams.

Buy NowGet 18% OFF

Click here for more information about Data Structures: A Pseudocode Approach with C

Read More...

An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science) Review

An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science)
Average Reviews:

(More customer reviews)
If you have cut your teeth on Donald Knuth's classic three volumes, "The Art of Computer Programming", and you want more detail, at a similar level of complexity, then consider Storer's book.
It delves into lists, recursion, trees, graphs, heaps and sets. Like Knuth, Storer thoughtfully supplies an extensive list of questions at the end of each chapter that will greatly deepen your appreciation of the field if you tackle them. Ok, he doesn't give answers, but think of that as greater incentive on your part to solve them. There are almost 400 questions in the book.
The teaching style is similar to Knuth, in that it has all the rigour needed by an algorithm designer like yourself, without drowning you in epsilon-delta ultra rigour like a pure maths text.
Note that the only code fragments are in pseudocode. This should not be a problem for you. I am assuming you are experienced enough that what you need is understanding of an algorithm, and that manually converting it to code is straightforward and a purely secondary issue.
The take home message is that this is excellent for anyone doing serious programming.

Click Here to see more reviews about: An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science)

Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates or first-year graduates who need only review Chapters 1 -4. * This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms). Also, lower bounds on sorting by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel

Buy NowGet 48% OFF

Click here for more information about An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science)

Read More...

Data Structures and Algorithms in C++ Review

Data Structures and Algorithms in C++
Average Reviews:

(More customer reviews)
On my bookshelf right now I have 13 books on DS&A using C++. Every time I am in need of a new type of data structure or algorithm, and quickly scan through each of them to determine which seem to have the most relevant information, and also which have useable source-code. Drozdek's book is almost always the book I end up selecting to learn a new topic.
Without a doubt, Drozdek's DS&A book is the most complete and well-written of its kind. It includes a chapter of graphs, which many books surprisingly omit. Also, as of the 3rd edition, it includes a chapter on string matching. As far as I know, this is the *only* C++ DS&A book to dive into this subject.
Surprisingly (because of such a broad-scoped book), the material presented in the string matching chapter is modern and incredibly useful. I found the coverage of suffix tries to be excellent. According to Professor Drozdek (via email correspondence), this chapter is actually a compressed version of what was to be an entire C++ book on string matching. Apparently no publisher would touch such a 'specialized' book. How short-sighted of them!
I work in a research-intensive company focused on developing cutting-edge algorithms to solve difficult modern problems. We do the majority of our coding in C++, which is what originally attracted me to Drozdek's book. Since then, I have referred several colleagues to this book, all of which now use it regularly and are loving it.
My only complaint about this book is that it doesn't discuss primality or random-number generation at all. So many algorithms rely heavily on one or both of these, so I find it strange that this book (and most others) completely ignore them.
As for the reviewer who negatively commented "worst written educational book I have ever read", this person obviously bought Drozdek's book expecting to learn C++ and not DS&A. If you're looking to learn C++, I recommend "C++ Primer Plus (5th Edition)" by Stephen Prata (ISBN: 0672326973). Despite its awkward title and oft-maligned publisher, it really is an excellent book for learning C++ (and also as a reference for an experienced programmer).
Depending on your needs, you might look into supplementing Drozdek's book with Robert Sedgewick's books 'Algorithms in C++'. His books do not go as deep as Drozdek does, but he provides an enormous number of fully implemented algorithms that don't exist in any other C++ DS&A book. Be sure to get the 3rd edition; it is much improved over the 2nd.
Here's a complete TOC of Drozdek's book (3rd edition):
Table of Contents
1. Object-Oriented Programming Using C++
2. Complexity Analysis
3. Linked Lists
4. Stacks and Queues
5. Recursion
6. Binary Trees
7. Multiway Trees
8. Graphs
9. Sorting
10. Hashing
11. Data Compression
12. Memory Management
13. String Matching
Appendices
A: Computing BIG-O
B: Algorithms in the Standard Template Library
C: NP-Completeness


Click Here to see more reviews about: Data Structures and Algorithms in C++

Using the C++ programming language, author Adam Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms' complexity. Second, the book presents data structures in the context of object-oriented program design, stressing the principle of information hiding in its treatment of encapsulation and decomposition. Finally, the book closely examines data structure implementation. Overall, this practical and theoretical book prepares students with a solid foundation in data structures for future coursesand work in design implementation, testing, or maintenance of virtually any software system.

Buy NowGet 39% OFF

Click here for more information about Data Structures and Algorithms in C++

Read More...

Data Structures and Algorithms in Java (2nd Edition) Review

Data Structures and Algorithms in Java (2nd Edition)
Average Reviews:

(More customer reviews)
This is an excellent book on data structures and algorithms and would be a great addition to a student's text book. Fortunately Lafore does not dwell on the algorithm analysis as many data structures books do. This is a plus for me, as most texts on the subject get the reader bogged down in the analysis portion of the subject matter. Note: algorithm analysis is a very important subject I just don't believe it should be taught in parallel with data structures to the extent it is. Its easier for me and many others to first learn how to implement data structures and get a feel for their performance then move on to in-depth analysis.
In this book you'll learn the more important data structures without the heavy mathematics many algorithm and data structure books torture readers with. The book is written in very accessible language and the applets really help the inexperienced see the algorithms in action.
As I mentioned this book does not cover algorithm analysis in detail. A step up from this book would be one of Sedgewick's books which provides more detail on the analysis front and some really 'tight' implementations. A good book that focuses on Algorithm Analysis is Intro to Algorithms by Cormen. You better have your math skills up to snuff for the Cormen book however.

Click Here to see more reviews about: Data Structures and Algorithms in Java (2nd Edition)



Buy NowGet 43% OFF

Click here for more information about Data Structures and Algorithms in Java (2nd Edition)

Read More...

Practical Introduction to Data Structures and Algorithm Analysis (C++ Edition) (2nd Edition) Review

Practical Introduction to Data Structures and Algorithm Analysis (C++ Edition) (2nd Edition)
Average Reviews:

(More customer reviews)
I used this textbook to teach Data Structures and Algorithms at the sophomore-junior level to a class of 100 students. My primary focus is to teach the design and use of DS&A with a secondary focus on implementation in a specific language (Java in this case). From this point of view: Part I is excellent. Part II is above average. The discussion of trees is average with an implicitly narrow view of applications. Part III on sorting and searching is average with the exception of the horrible discussion of benchmarking in 8.8. The data are unqualified and misleading (compiled and interpreted run-times are compared as equals!). The discussion of hashing and B-Trees is poorly organized and narrow. Parts III and IV are oriented towards Java implementation. As such, there is no discussion of the limitations of actually using recursion in an implementation nor the efficient use of object-oriented structures in cache-based architectures. For a better discussion of DS&A, many of my less experienced students found relief in Robert Lafore's book (ISBN 1571690956) and the more advanced students consulted Weiss's text (ISBN 0201357542). For the following term I will try Cormen, Leiserson, and Rivest's classic Introduction to Algorithms (ISBN 0070131430) which uses pseudo-code and Lafore's book as a required supplement.

Click Here to see more reviews about: Practical Introduction to Data Structures and Algorithm Analysis (C++ Edition) (2nd Edition)

This practical text contains fairly "traditional"coverage of data structures with a clear and complete use of algorithm analysis, and some emphasis on file processing techniques as relevant to modern programmers. It fully integrates OO programming with these topics, as part of the detailed presentation of OO programming itself. Chapter topics include lists, stacks, and queues; binary and general trees; graphs; file processing and external sorting; searching; indexing; and limits to computation. For programmers who need a good reference on data structures.

Buy NowGet 40% OFF

Click here for more information about Practical Introduction to Data Structures and Algorithm Analysis (C++ Edition) (2nd Edition)

Read More...

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics) Review

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics)
Average Reviews:

(More customer reviews)
A stunning 1000 page encyclopedia of spatial, multidimensional, and metric data structures and algorithms presented in the Knuth tradition. The general coverage is broader than an older, now out of print and expensive: "Design and Analysis of Spatial Data Structures". In a surprise, the new book is not only the size of a telephone directory, but it has double the number of useful pages. 4 extensive chapters cover data structures and algorithms for: points, objects and images, intervals and small rectangles, and the same data types in higher +dimensions. Within each chapter, the algorithms and clearly presented and are accompanied by an extensive use of figures. The algorithms which run from the expected to the exotic are summarized by the table of contents at the publisher's web site. Unexpected algorithms are also covered including: nearest neighbor finding which is useful for clustering applications, image pyramids, and object pyramids or hierarchies such as R-trees.The book has a textbook flavor with exercises at the end of each section where specifics are left for the student; however, solutions and pseudo-code for many of the exercises are in a 300+ page appendix maintaining the book as a useful reference. This book is comprehensive, inexpensive, and in my mind - a must have.

Click Here to see more reviews about: Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics)



Buy NowGet 22% OFF

Click here for more information about Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics)

Read More...