Showing posts with label programming. Show all posts
Showing posts with label programming. 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...

Concurrency: State Models and Java Programs Review

Concurrency: State Models and Java Programs
Average Reviews:

(More customer reviews)
This book does not belong with other Java books. This is a real computer science textbook that should be sitting next to Rivest's Algorithms book. The use of Java is incidental and makes the book very accessible without detracting from the issues at hand. It has to be one of the most well conceived computer science books ever written.
The material covered is maddeningly difficult to master informally because concurrency errors often manifest themselves as rare, random, and disastrous events that cannot be reproduced. Most of the book is laying down a solid formal foundation in which to reason about concurrency; the only hope for getting it right when things are difficult. It also comes with analysis tools (in Java of course!) to help people who learn by exploration, experimentation, and visualisation.

Click Here to see more reviews about: Concurrency: State Models and Java Programs

Concurrency provides a thoroughly updated approach to the basic concepts and techniques behind concurrent programming. Concurrent programming is complex and demands a much more formal approach than sequential programming. In order to develop a thorough understanding of the topic Magee and Kramer present concepts, techniques and problems through a variety of forms: informal descriptions, illustrative examples, abstract models and concrete Java examples. These combine to provide problem patterns and associated solution techniques which enable students to recognise problems and arrive at solutions.
New features include:
New chapters covering program verification and logical properties.
More student exercises.
Supporting website contains an updated version of the LTSA tool for modelling concurrency, model animation, and model checking.
Website also includes the full set of state models, java examples, and demonstration programs and a comprehensive set of overhead slides for course presentation.



Buy Now

Click here for more information about Concurrency: State Models and Java Programs

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...

Strategic Asset Allocation in Fixed Income Markets: A Matlab based user's guide (The Wiley Finance Series) Review

Strategic Asset Allocation in Fixed Income Markets: A Matlab based user's guide (The Wiley Finance Series)
Average Reviews:

(More customer reviews)
Quoting the Soviet worker who wrote to The Pravda to condemn "Dr. Zhivago": "I have not read the book, but I deplore it". The table of contents left me puzzled. Term-structure models are dealt with over just 18 pages - this seems to satisfy all the five-star reviewers - after nothing more than fixed-income basics, there's talk of CAPM (is that the proposed approach to fixed-income asset allocation?), a why-these-particular-topics foray into econometrics, and some novice-oriented Matlab content. (GUIs?) I am struggling to see the book as a credible reference on the subject of its title.


Click Here to see more reviews about: Strategic Asset Allocation in Fixed Income Markets: A Matlab based user's guide (The Wiley Finance Series)


Matlab is used within nearly all investment banks and is a requirement in most quant job ads. There is no other book written for finance practitioners that covers this
Enables readers to implement financial and econometric models in Matlab
All central concepts and theories are illustrated by Matlab implementations which are accompanied by detailed descriptions of the programming steps needed
All concepts and techniques are introduced from a basic level
Chapter 1 introduces Matlab and matrix algebra, it serves to make the reader familiar with the use and basic capabilities if Matlab. The chapter concludes with a walkthrough of a linear regression model, showing how Matlab can be used to solve an example problem analytically and by the use of optimization and simulation techniques
Chapter 2 introduces expected return and risk as central concepts in finance theory using fixed income instruments as examples, the chapter illustrates how risk measures such as standard deviation, Modified duration, VaR, and expected shortfall can be calculated empirically and in closed form
Chapter 3 introduces the concept of diversification and illustrates how the efficient investment frontier can be derived - a Matlab is developed that can be used to calculate a given number of portfolios that lie on an efficient frontier, the chapter also introduces the CAPM
Chapter 4 introduces econometric tools: principle component analysis is presented and used as a prelude to yield-curve factor models. The Nelson-Siegel model is used to introduce the Kalman-Filter as a way to add time-series dynamics to the evolution of yield curves over time, time series models such as Vector Autoregression and regime-switching are also presented
Supported by a website with online resources - www.kennyholm.com where all Matlab programs referred to in the text can be downloaded. The site also contains lecture slides and answers to end of chapter exercises


Buy NowGet 36% OFF

Click here for more information about Strategic Asset Allocation in Fixed Income Markets: A Matlab based user's guide (The Wiley Finance Series)

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...

Information Retrieval: Algorithms and Heuristics (The Springer International Series in Engineering and Computer Science) Review

Information Retrieval: Algorithms and Heuristics (The Springer International Series in Engineering and Computer Science)
Average Reviews:

(More customer reviews)
If you're working in the IR industry, or want to develop software in this field, this book is a great starting point. A clarification: this will is not a book for researchers -- instead think of it as a book for advanced practitioners or engineers needing to work in this area. Inside you'll see complete worked examples of several fundamental computations rather than detailed proofs.

Click Here to see more reviews about: Information Retrieval: Algorithms and Heuristics (The Springer International Series in Engineering and Computer Science)

Information Retrieval: Algorithms and Heuristics is acomprehensive introduction to the study of information retrievalcovering both effectiveness and run-time performance. The focus of thepresentation is on algorithms and heuristics used to find documentsrelevant to the user request and to find them fast. Through multipleexamples, the most commonly used algorithms and heuristics needed aretackled. To facilitate understanding and applications, introductionsto and discussions of computational linguistics, natural languageprocessing, probability theory and library and computer science areprovided. While this text focuses on algorithms and not on commercialproduct per se, the basic strategies used by many commercial productsare described. Techniques that can be used to find information on theWeb, as well as in other large information collections, are included.This volume is an invaluable resource for researchers, practitioners,and students working in information retrieval and databases. Forinstructors, a set of Powerpoint slides, including speaker notes, areavailable online from the authors.

Buy Now

Click here for more information about Information Retrieval: Algorithms and Heuristics (The Springer International Series in Engineering and Computer Science)

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 and Abstractions with Java Review

Data Structures and Abstractions with Java
Average Reviews:

(More customer reviews)
We have been using this book at CSUCI as a textbook for a CS2 class with a heavy hands-on component. The book is very good in that role, and the lab manual - in spite of numerous errors in the first edition - is a very good companion.
It is neither a tutorial nor a reference; it is a textbook for a university-level course. It teaches students how to embed numerous data structures and algorithms in Abstract Data Types (ADTs), how to use them from clients, and how to utilize the existing equivalents from the Java libraries (mainly Java Collection Framework).
I highly recommend this book along with the lab manual to CS2 instructors.


Click Here to see more reviews about: Data Structures and Abstractions with Java



Buy Now

Click here for more information about Data Structures and Abstractions with Java

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...

Purely Functional Data Structures Review

Purely Functional Data Structures
Average Reviews:

(More customer reviews)
Okasaki's slim volume is one of the best expositions on implementing data structures & algorithms in a functional language. After taking an introductory course on functional programming, this would be the book which tells you where to go next.
This book doesn't just present a rehash/rewrite of imperative data structures, only written in a functional language. Instead, Okasaki makes sure to emphasize benefits which only functional programming can bring to the table. For example, many functional data structures can compactly represent not just their current state, but all of their past states as well--a feature called "Persistence". Also, functional newbie programmers might be wondering why lazy vs. strict programming is a big deal, and Okasaki shows clearly where data structures can benefit from either being lazy or being strict.
For the advanced reader, Okasaki also presents several powerful techniques for analyzing the runtime of algorithms, including the so-called "Banker's Method" and the "Physicist's Method" for analyzing amortized algorithms.
I hope that Okasaki comes out with a 2nd edition of this book; there is one missing piece in particular which I really wish he would have included: Although he presents an EXTREMELY lucid description of how to implement Red-Black trees in a functional language, he only presented algorithms for insertion and querying. Of course, deletion from a red-black tree is the hardest part, left here, I suppose, as an exercise to the student. If you want to supply this missing piece yourself, check out a paper by Stefan Kars, "Red-black trees with types", J. Functional Programming 11(4):425-432, July, 2001. It presents deletion routines, but you'll still want to read Okasaki's book first, for unless you're very much smarter than me you won't be able to understand Kars' paper until you read Okasaki's exposition of red black trees.
Finally, this book is not just useful for programmers in functional languages; logic programmers, using prolog or a varient, will also find this book very helpful, because most of the techniques (all of the techniques, really, with the exception perhaps of the lazy programming stuff) can be directly applied in a prolog programming setting as well.
After reading this book and implementing some of the data structures for yourself, you'll be amazed at how fast algorithms can run, even when written in a functional language!

Click Here to see more reviews about: Purely Functional Data Structures

Most books on data structures assume an imperative language such as C or C++.However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme.This book describes data structures from the point of view of functional languages, with examples, and presents design techniques that allow programmers to develop their own functional data structures.The author includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages.All source code is given in Standard ML and Haskell, and most of the programs are easily adaptable to other functional languages. This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study.

Buy NowGet 7% OFF

Click here for more information about Purely Functional 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...

Principles of Database & Knowledge-Base Systems, Vol. 1: Classical Database Systems Review

Principles of Database and Knowledge-Base Systems, Vol. 1: Classical Database Systems
Average Reviews:

(More customer reviews)
This book goes into the details of database conception and use. It's not completely up to date but tells you everything on relational databases. from theory to the actual used algorithms.

Click Here to see more reviews about: Principles of Database & Knowledge-Base Systems, Vol. 1: Classical Database Systems

Classical database technology is oriented toward a well-understood class of applications. Recently the field has attempted to solve the problems associated with new kinds of applications: computer-aided design, software engineering, and others that combine the need to deal with large amounts of data efficiently and the need to support queries in languages that are more expressive than those found in classical database systems. This book attempts to integrate the study of both the new and the classical forms of database systems.

Buy Now

Click here for more information about Principles of Database & Knowledge-Base Systems, Vol. 1: Classical Database Systems

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...