Rating: 
Summary: A great book!
Review: This book has thirteen chapters. It covers Lists, Stacks & Queues, Arrays, Recursion, Trees, Balanced Trees, Decision Trees, Sorting, Searching, Hashing, Network Algorithms and Object-Oriented Techniques. The one I'm most interested in is Chapter 8 (Decision Trees), the book has a small Tic-Tac-Toe game and source code. The game has 9 levels of "Artificial Intelligence". I thought I'd find some source code or explanation on chess game when I bought this book. This is the only reason that disappoints me slightly, other than that, it's a great book.
Rating:
Summary: A great book!
Review: This book has thirteen chapters. It covers Lists, Stacks & Queues, Arrays, Recursion, Trees, Balanced Trees, Decision Trees, Sorting, Searching, Hashing, Network Algorithms and Object-Oriented Techniques. The one I'm most interested in is Chapter 8 (Decision Trees), the book has a small Tic-Tac-Toe game and source code. The game has 9 levels of "Artificial Intelligence". I thought I'd find some source code or explanation on chess game when I bought this book. This is the only reason that disappoints me slightly, other than that, it's a great book.
Rating:
Summary: A must-have reference for every VB developer
Review: This is a required reference where I work. The book is very accessible to those of us who taught ourselves programming and lack the formal computer science education.As noted by other reviewers, you do need to have some skill with VB to get through the material; I would suggest that, as a minimum skill level, the reader be just about to "qualify" as an intermediate VB programmer. Coverage includes sorting algorithms, queues, hashes, binary trees, linked lists, spanning trees, and much more.
Rating: 
Summary: A very good reference, even if it's not perfect...
Review: Very good reference: fine examples, good clean code. Some bugs in the combinatorial optimization section (branch and bound, etc.) need to be cleaned up (the best isn't always picked). Still, it's a very useful book.
Rating:
Summary: A very good reference, even if it's not perfect...
Review: Very good reference: fine examples, good clean code. Some bugs in the combinatorial optimization section (branch and bound, etc.) need to be cleaned up (the best isn't always picked). Still, it's a very useful book.
|
