Concurrency: State Models and Java Programs Review

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.

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

Read More...

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

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.

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

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

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

Read More...

Data Structures and Abstractions with Java Review

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

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

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.

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

Read More...

Data Structures and Algorithms in Java with CDROM (Worldwide Series in Computer Science) Review

Average Reviews:

(More customer reviews)I'm finding the 4th edition reasonably clear and comprehensive. However, the book is teeming with typographical errors. Most of them are typesetting errors involving superscripts and subscripts that overlap the adjacent characters so they aren't fully legible. But there are numerous other miscellaneous typos.
So, I've been marking them in my copy, in order to submit them to the authors or publisher, but apparently they don't want to know about the typos. The "errata" section at java.datastructures.net contains no errata and no instructions on how to submit errata. I wrote to one of the authors to ask how to submit errata, but received no reply.

Click Here to see more reviews about: Data Structures and Algorithms in Java with CDROM (Worldwide Series in Computer Science)

This text incorporates the object-oriented design paradigm throughout using Java as the implementation language, while also providing the fundamental intuition and analysis of each structure studied. The authors seek to present a "learning system" book. The book is accompanied by a web site which provides students with applications of the Java language as well as Java applets, the complete source code developed for the book and suites of test data used for the programming assignments.

Click here for more information about Data Structures and Algorithms in Java with CDROM (Worldwide Series in Computer Science)

Read More...

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

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.

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

Read More...

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

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

Get 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 Java (2nd Edition) Review

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)

Get 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

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.

Get 40% OFF

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

Read More...

Object-Oriented Discrete-Event Simulation with Java - A Practical Introduction (SERIES IN COMPUTER SYSTEMS (previously: The Plenum Series in Computer (Series in Computer Science) Review

Average Reviews:

(More customer reviews)Some of the concepts were new to me and some were not. The old ideas were the ones that I came across in a first Java programming course or in a discrete-event simulation course. Book is easy to read, concise, not a textbook. Useful for someone that has not studied anything about discrete-event simulation.

Click Here to see more reviews about: Object-Oriented Discrete-Event Simulation with Java - A Practical Introduction (SERIES IN COMPUTER SYSTEMS (previously: The Plenum Series in Computer (Series in Computer Science)

This book introduces the application of the Java programminglanguage in discrete-event simulation. In addition, the fundamentalconcepts and practical simulation techniques for modeling differenttypes of systems to study their general behavior and their performanceare introduced. The approaches applied are the process interactionapproach to discrete-event simulation and object-oriented modeling.Java is used as the implementation language and UML as the modelinglanguage. The first offers several advantages compared to C++, themost important being thread handling, graphical user interfaces (GUI),and Web computing. The second language, UML (Unified ModelingLanguage), is the standard notation used today for modeling systems asa collection of classes, class relationships, objects, and objectbehavior. The book concentrates on object-oriented modeling andimplementation aspects of simulation models using Java and practicalsimulation techniques. In addition, the book illustrates the dynamicbehavior of systems using the various simulation models as casestudies.

Click here for more information about Object-Oriented Discrete-Event Simulation with Java - A Practical Introduction (SERIES IN COMPUTER SYSTEMS (previously: The Plenum Series in Computer (Series in Computer Science)

Read More...

Advanced ANSI SQL Data Modeling and Structure Processing Review

Average Reviews:

(More customer reviews)Ever since i read this book first in a library in Atlanta, I coudlnt hold myself but buy this book immediately the following week.
Excellent description on data modelling, and has clear diagrams that are easy to understand.
a must have for all serious sql data modelling guys and programmers..

Click Here to see more reviews about: Advanced ANSI SQL Data Modeling and Structure Processing

This volume is a tool for utilizing the ANSI/ISO SQL outer join operation, and a guide to using this operation to perform simple or complex data modelling. It provides a look at the outer join operation, its powerful syntax, and features and capabilities that can be developed based on the operation's data modelling capacity. The author demonstrates how to tap into the power of data structure extraction technology that gathers data structure meta information naturally embedded in ANSI/ISO SQL outer join specifications. He also addresses existing SQL capabilities for improving performance, saving coding time, simplifying design, and reducing debugging time. The book also supplied critical review of the semantics of data structures; tells you how to perform multi-table outer joins and how to combine relational structures with hierarchical structures; and describes how to establish a default database standard or framework for data modelling.

Click here for more information about Advanced ANSI SQL Data Modeling and Structure Processing

Read More...

Design of Multithreaded Software: The Entity-Life Modeling Approach Review

Average Reviews:

(More customer reviews)Dr Sanden has created a very impressive piece of literature. As a professor of computer science, I found this book to be an incredible asset to my professional "tool kit," so to speak. Further, Dr. Sanden's book would be critical asset as a text book as its narration keeps the reader enticed, yet has a number of solid application concepts. I unequivocally recommend this book as a professional asset as well as a text book. Again, this book is quite an impressive piece of work that is a strong contribution to this professional field.

Click Here to see more reviews about: Design of Multithreaded Software: The Entity-Life Modeling Approach

This book assumes familiarity with threads (in a language such as Ada, C#, or Java)and introduces the entity-life modeling (ELM) design approach for certain kinds of multithreaded software. ELM focuses on "reactive systems," which continuously interact with the problem environment. These "reactive systems" include embedded systems, as well as such interactive systems as cruise controllers and automated teller machines.
Part I covers two fundamentals: program-language thread support and state diagramming. These are necessary for understanding ELM and are provided primarily for reference. Part II covers ELM from different angles. Part III positions ELM relative to other design approaches.

Get 21% OFF

Click here for more information about Design of Multithreaded Software: The Entity-Life Modeling Approach

Read More...

Computational Nanotechnology: Modeling and Applications with MATLAB® (Nano and Energy) Review

Average Reviews:

(More customer reviews)This is the best book on the market for computational nanotechnology.The book has many applications in Biology, electronics, aerospace, energy productions, and madicine.

Click Here to see more reviews about: Computational Nanotechnology: Modeling and Applications with MATLAB® (Nano and Energy)

Written to help professionals, researchers, and students discover the challenges and opportunities associated with development of next-generation nanoscale computational nanotechnology, this book covers a broad range of technical information, research ideas, and practical knowledge regarding applications in this area. Offering thought-provoking perspective on the developments that are poised to revolutionize the field, the author explores both existing and future nanotechnology applications, which hold great promise for significant innovations in engineering, physics, chemistry, biology, and medicine.

Get 12% OFF

Click here for more information about Computational Nanotechnology: Modeling and Applications with MATLAB® (Nano and Energy)

Read More...

Software Modeling and Design: UML, Use Cases, Patterns, and Software Architectures Review

Average Reviews:

(More customer reviews)If you want to learn to use UML as a communication tool on your software development projects, this is the book too own. It contains a ton of examples and covers every aspect of the UML you will need to know to successfully use it on your projects.
The book starts out with an introduction to software architecture and object oriented analysis and design with UML.
There is then a short chapter on UML notation, a chapter on software development processes, and one on software design and architectural concepts. The last chapter in part one introduces COMET (Collaborative Object Modeling and Architectural Design Method), which is the author's software modeling and design method.
To me COMET is not really that much different than the Unified Process, which is a great process. COMET just breaks out the testing activities a little differently. COMET is a very usable process and if used correctly should lead to successful software development projects.
Part two of the book is all about modeling. There is a chapter on Use Case Modeling, Static Modeling, Object and Class Structuring, Dynamic Interaction Modeling, Finite State Machines, and State-Dependent Dynamic Interaction Modeling.
By the time you are done with part two of this book you will know all you need to know to produce high quality diagrams that can be used between the different stakeholders on your projects as very effective communication tools.
Part three of the book covers software architecture. There is a chapter on the Overview of Software Architecture, Software Subsystem Architectural Design, Designing Object-Oriented Software Architectures, Designing Client/Server Software Architectures, Designing Service-Oriented Architectures, Designing Component-Based Software Architectures, Designing Concurrent and Real-Time Software Architectures, Designing Software Product Line Architectures, and a chapter on Software Quality Attributes.
If the chapter on Software Product Lines interests you, I would highly recommend buying the author's book tilted Designing Software Product Lines with UML: From Use Cases to Pattern-Based Software Architectures.
I really the like the way part two introduces the different perspectives you need to have when considering the type of architecture you are building. The way the author accomplishes this is unique to this book. I have not seen it broken down this way before, and it really provides some great insight.
Part three contains several case studies. Each one provides a detailed design of the system being discussed. These are great for seeing how well the design techniques in this book work. You get a complete understanding of each of the systems in the case studies by the time you are done reading the chapter.
This book is really well written and organized. You can read it from front to back or use it as a reference. Each chapter ends with exercise questions. I usually just ignore these, but since the author has decided to include the answers I enjoyed trying to answer them.
The book has an appendix which contains a nice catalog of software architectural patterns. It is a summary of architectural structure patterns, communication patterns, and transaction patterns. It contains a summary of the pattern and the location it is used in the book.
All in all this is a very high quality book packed with very valuable information any architect at an level of experience will benefit from. Hi highly recommend this book!!!!

Click Here to see more reviews about: Software Modeling and Design: UML, Use Cases, Patterns, and Software Architectures

Get 25% OFF

Click here for more information about Software Modeling and Design: UML, Use Cases, Patterns, and Software Architectures

Read More...