Data Structures and Algorithms Using Visual Basic.NET

ISBN-13: 9780521547659 / Angielski / Miękka / 2005 / 414 str.

Michael McMillan

Opis

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.

Recenzje

“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

Spis treści

1. Collections; 2. Arrays and the array class; 3. The arraylist and sortedlist classes; 4. Basic sorting algorithms; 5. Basic searching algorithms; 6. Stacks and queues; 7. BitArrays and the BitVector structure; 8. Strings, the string class and the StringBuilder class; 9. Special string classes - StringCollection, StringDictionary and StringEnumerator; 10. Pattern matching and text processing - using the RegEx and supporting classes; 11. Hash tables; 12. Dictionaries - the DictionaryBase class and specialized dictionary classes; 13. Linked lists; 14. Binary trees and binary search trees; 15. Sets; 16. Advanced sorting algorithms; 17. Advanced searching algorithms; 18. Graphs and graph algorithms; 19. Greedy algorithms; 20. Probabilistic algorithms; 21. Dynamic programming.