Ready-to-Run Visual BasicAlgorithms / Edition 2

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 96%)
Other sellers (Paperback)
  • All (25) from $1.99   
  • New (5) from $13.68   
  • Used (20) from $1.99   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$13.68
Seller since 2008

Feedback rating:

(71)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
1998 Paperback New Ships Fast! Satisfaction Guaranteed!

Ships from: Skokie, IL

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$13.81
Seller since 2011

Feedback rating:

(451)

Condition: New
1998 Paperback New

Ships from: san francisco, CA

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$49.95
Seller since 2013

Feedback rating:

(79)

Condition: New
New New. Free delivery confirmation. Satisfaction guaranteed!

Ships from: Rahway, NJ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$53.76
Seller since 2014

Feedback rating:

(227)

Condition: New
Brand New Item.

Ships from: Chatham, NJ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$65.00
Seller since 2014

Feedback rating:

(113)

Condition: New
Brand new.

Ships from: acton, MA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Overview

Since the publication of the first edition of this well-received book, several new easier-to-use versions of VB have been released and object-oriented algorithms have become a reality. This new edition brings a popular book up to speed with these developments. It describes a large set of algorithms important to a variety of programming situations. Each algorithm is described in detail and is accompanied by implementation code and working examples. The new topics include new algorithm concepts and techniques for VB 4.0 and 5.0, new object-oriented VB algorithms, and a library of ready-to-run code implementing the most important algorithms.

Includes CD-ROM with...

  • Source code for all algorithms in the book.
  • Test programs for using the algorithms.
  • One or more large databases for use with the programs.
  • U.S. highway system network to use with the network algorithms.
  • Examples and tests for training and college market.
Read More Show Less

Editorial Reviews

Chris Jaekl

An Algorithms Cookbook for VB Programmers

As a student of computer science, I had a fundamental principle drilled into my head time and time again -- languages come and go, but algorithms stand the test of time. A good algorithms reference doesn't need to focus on a particular language; however, those books tend to be crammed with computer-scientists' jargon, and provide less than an ideal starting point for the novice programmer. Rod Stevens' Ready-to-Run Visual Basic Algorithms, Second Edition is an attempt to bridge the gap, to help people who know the rudiments of programming in Visual Basic (VB) experiment with tried-and-tested algorithms and incorporate them into their own programs.

To make sense of this book, you must already be familiar with variables, conditional statements, loops, subroutines, and abstract data types. Even more advanced topics, such as class declarations and static variables, are introduced and used so quickly that a novice programmer will probably need an additional reference. In other words, Ready-to-Run Visual Basic Algorithms, is a logical "next step" for someone who has completed an introduction to VB programming, but you should make sure that you've understood at least one other book about VB before attempting to read this one. I applaud this approach, because it lets you concentrate on learning algorithms without getting bogged down by syntactic details.

Stephens describes all of the standard data structures that should be part of every programmer's toolkit: arrays, linked lists, stacks, queues, trees (including AVL and B-Trees), and hash tables. As for algorithms, he provides a competent description of the standard searching and sorting techniques (as you would expect from any algorithms book), a readable (and gentle) introduction to recursion, a reasonable discussion of decision trees and network algorithms, and a superficial treatment of hard (aka NP-complete) problems.

The book's first edition dealt with VB 3, which didn't support classes; this edition's final chapter is a grab-bag of miscellaneous information about object- oriented (OO) techniques that are possible with VB 4, but didn't seem to fit anywhere else in the revised text. This final chapter contains some interesting nuggets of programming wisdom, but it's too brief and jumps between topics too quickly to be of much use.

The book is accompanied by a CD with VB source code for the algorithms that it discusses, and example programs which let users interactively explore performance tradeoffs on their own computer system. The theoretician in me was pleased to find a short but adequate description of complexity analysis, including asymptotic bounds and "Big Oh" notation. I think that the author struck a good balance here between rigor and readability.

My major complaint about Ready-to-Run, is with its physical layout and typesetting. When terms are defined, they should be highlighted, or at least printed in bold type; the use of simple italics makes it hard to find the term in a page full of text. Likewise, equations are buried in the body of the text, which makes them hard to read; it would be helpful if they were centered, and denominators were printed underneath their numerators. The page layout algorithm often causes figures to turn up on the following page, in the midst of some unrelated text, necessitating annoying back-and-forth page-flipping. Also, the book would benefit from a few more diagrams and an additional metaphor or two. For example, when introducing stacks, Stephens merely states that:

"For historical reasons, adding an item to a stack is called pushing the item onto the stack, and removing an item from a stack is called popping the item off the stack."

Most programmers have eaten in a cafeteria at some point in their lives, and many will recall encountering a stack of plates in a spring-loaded dispenser there; the weight of a new plate added to the top of the stack pushes the entire stack down into the dispenser, while removing a plate from the top causes the spring to pop the stack back up. That's where the "historical" term comes from, and it's easier to remember the terms (and the last-in, first-out nature of stacks) once you've heard the story.

The cover of Ready-to-Run Visual Basic Algorithms, depicts someone dumping code out of a book directly into a computer. If that is your objective -- as a VB programmer, to quickly incorporate some standard algorithms into your code -- then this is a good place to turn. Also, if you already know VB and are looking for a quick introduction to algorithms, this book may be for you. Otherwise (if you're not using VB, or if you're seeking a deep understanding of the issues inherent in algorithm design), I'd recommend looking elsewhere. My personal favorite is Introduction to Algorithms, by Cormen, Leiserson, and Rivest (MIT Press, 1990). While programming languages have changed in the past decade, the design and implementation of standard algorithms hasn't.--Dr. Dobb's Electronic Review of Computer Books

Read More Show Less

Product Details

  • ISBN-13: 9780471242680
  • Publisher: Wiley, John & Sons, Incorporated
  • Publication date: 3/27/1998
  • Edition description: 2ND BK&CDR
  • Edition number: 2
  • Pages: 416
  • Product dimensions: 7.53 (w) x 9.28 (h) x 1.05 (d)

Table of Contents

Introduction
Ch. 1 Fundamental Concepts 1
Ch. 2 Lists 17
Ch. 3 Stacks and Queues 49
Ch. 4 Arrays 67
Ch. 5 Recursion 81
Ch. 6 Trees 117
Ch. 7 Balanced Trees 155
Ch. 8 Decision Trees 187
Ch. 9 Sorting 225
Ch. 10 Searching 265
Ch. 11 Hashing 281
Ch. 12 Network Algorithms 313
Ch. 13 Object-Oriented Techniques 355
App. A: Using the CD-ROM 373
App. B: List of Example Programs 377
Index 381
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)