Skip to main content Accessibility help
×
Publisher:
Cambridge University Press
Online publication date:
August 2009
Print publication year:
2005
Online ISBN:
9780511547010

Book description

This is the first Visual Basic.NET book to provide a comprehensive discussion of the major data structures and algorithms. Here, instead of having to translate material on C++ or Java, the professional or student VB.NET programmer will find a tutorial on how to use data structures and algorithms and a reference for implementation using VB.NET for data structures and algorithms from the .NET Framework Class Library as well as those which must be developed by the programmer. In an object-oriented fashion, the author presents arrays and arraylists, linked lists, hash tables, dictionaries, trees, graphs, sorting and searching as well as more advanced algorithms, such as probabilistic algorithms and dynamic programming. His approach is very practical, for example using timing tests rather than Big O analysis to compare the performance of data structures and algorithms. This book can be used in both beginning and advanced computer programming courses that use the VB.NET language and, most importantly, by the professional VB programmer.

Reviews

“Choosing which data structure and sorting algorithms to use can have a great effect on the speed of the program. This book helps programmers make those choices. This book begins with an introduction to properties and classes in VB.NET. It also describes the creation of a timing test in the VB.NET environment, which is used repeatedly in later chapters to demonstrate how different structures and searching techniques can change program completion time. This little bit of code is the prize inside, since it can be used whenever timing of VB.NET programming is needed…[This book] thoroughly covers the basics, and some more advanced topics of data structures and searching algorithms, using VB.NET with a minimalist approach.”
Computing Reviews

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
×

Contents

References
Bentley, Jon. Programming Pearls. Second Edition. Reading, Massachusetts: Addison-Wesley, 2000
Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., and Clifford, Stein. Introduction to Algorithms. Cambridge, Massachusetts: The MIT Press, 2001
Ford, William and William, Topp. Data Structures with C++. Upper Saddle River, New Jersey: Prentice Hall, 1996
Friedel, Jeffrey E. F.Mastering Regular Expressions. Sebastopol, California: O'Reilly and Associates, 1997
Knuth, Donald E., The Art of Computer Programming, Volume 1, Fundamental Algorithms. Reading, Massachusetts: Addison Wesley, 1998
LaFore, Robert. Data Structures and Algorithms in Java. Corte Madera, California: Waite Group Press, 1998
McMillan, Michael. Object-Oriented Programming with Visual Basic.NET. New York: Cambridge University Press, 2004
Sedgewick, Robert. Algorithms in C. Reading, Massachusetts: Addison Wesley, 1998
Weiss, Mark Allen. Data Structures and Algorithm Analysis in Java. Reading, Massachusetts: Addison Wesley, 1999

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.