Data Structures and Algorithms Using Visual Basic.NET - Michael McMillan

Data Structures and Algorithms Using Visual Basic.NET

Buch | Softcover
414 Seiten
2005
Cambridge University Press (Verlag)
978-0-521-54765-9 (ISBN)
67,30 inkl. MwSt
At last, the VB.NET programmer has a dedicated reference - no more translating elementary material from C++ or Java. This is the only VB.NET book that provides comprehensive discussions of the major data structures and algorithms from the .NET Framework Class Library, as well as those that the programmer must develop.
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.

Michael McMillan is an instructor of Computer Science at Pulaski Technical College in Arkansas. He has written a textbook on Perl programming and co-authored an introductory textbook on Visual Basic.NET. He has also published over twenty articles in different trade journals on computer programming in Visual Basic, Perl and VBScript.

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.

Erscheint lt. Verlag 7.3.2005
Zusatzinfo 75 Line drawings, unspecified
Verlagsort Cambridge
Sprache englisch
Maße 191 x 235 mm
Gewicht 710 g
Themenwelt Mathematik / Informatik Informatik Programmiersprachen / -werkzeuge
Informatik Theorie / Studium Algorithmen
ISBN-10 0-521-54765-2 / 0521547652
ISBN-13 978-0-521-54765-9 / 9780521547659
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99