Including a tutorial on how to use data structures and algorithms and a reference for implementation using VB.NET and the .NET Framework Class Library, this is the first Visual Basic.NET book to provide a comprehensive discussion of the major data structures and algorithms. Michael McMillan 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 in an object-oriented fashion. Finally, the professional or student VB.NET programmer has a dedicated reference instead of having to translate material on C++ or Java.
Book Description
Frequently Bought Together
Editorial Reviews
Review
“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
Computing Reviews
Book Description
This is the first Visual Basic.NET book to provide a comprehensive discussion of the major data structures and algorithms, including a tutorial on how to use data structures and algorithms and a reference for implementation using VB.NET and the .NET Framework Class Library. 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. Finally, the professional or student VB.NET programmer has a dedicated reference instead of having to translate material on C++ or Java.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
5 of 6 people found the following review helpful:
5.0 out of 5 stars
Excellent,
By
This review is from: Data Structures and Algorithms Using Visual Basic.NET (Paperback)
I have selected this book to be the textbook of an introductory course in data structures and algorithms for my second year programming students. There were three major reasons behind this choice:1- The book doesn't go into the mathematics found in other books. Of course, mathematics are essential for those who want to create algorithms, but it's not the case for the majority of programmers, at least in the business computing field, who just want to implement them. On the contrary, I think that teaching the mathematics underlying the construction of algorithms makes the learning process unnecessarily hard. 2- On the data structures field, the book takes advantage of structures already implemented in the major development platforms. As the author says it: "students of data structures and algorithms can now see how to use a data structure before learning how to implement it" (Preface, p. vii). From an educational standpoint, this is a far better approach than starting to discuss a concept abstractly. 3- The examples are in VB .NET, which I consider a good starting programming language. For those who rather prefer another language, the author has recently published the same book for C#: "Data Structures and Algorithms Using C#". In a word, I consider this book an excellent practical approach to learn common data structures and algorithms without going into the complexity of mathematics.
9 of 12 people found the following review helpful:
4.0 out of 5 stars
introductory algorithm course,
By
This review is from: Data Structures and Algorithms Using Visual Basic.NET (Paperback)
McMillan does for Visual Basic in .NET what other languages like Java, C and C++ have long had. Fundamental data structures like hash tables or hash sets, arrays, linked lists. He shows how to use these in the VB context. They greatly simplify your programming tasks. These constructs are so widely used in any practical programming language.Without them, you find yourself having to tediously reinvent basic functionality. Adding little value. And with the risk that your implementations might be buggy. McMillan shows how to use the structures in several algorithms. Having said that, this book will not be of any surprise to someone already familiar with algorithms. It does not go into these to the depth of Knuth's 'Art of Computer Programming', or Sedgewick's texts.
2 of 2 people found the following review helpful:
5.0 out of 5 stars
Programmer,
By Creative Identity "VB Programmer" (South Jersey) - See all my reviews
This review is from: Data Structures and Algorithms Using Visual Basic.NET (Paperback)
Michael McMillan's "Data Structures and Algorithms Using Visual Basic.Net" is an excellent resource for the serious programmer using Visual Basic.Net. With the advent of the .Net technology there have been some major changes to Visual Basic, one of them being the collection classes. Most vb reference books provide a weak introduction to the collections and how to use them; this is the focus of the book and really allows the reader to gain enough confidence to start using them effectively in their own programs.I look forward to more books from this author.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
setl intersection, advanced sorting algorithms, custom collection class, circularly linked list, iterator class, skip list, grades array, header node, hash table implementation, jagged array, queue class, initialization list, binary search method, timing code, grouping constructs, insert method, linear collection, constructor method, insertion sort, binary search algorithm, deleted node, topological sorting, binary search tree, dynamic programming solution, selection sort Key Phrases - Capitalized Phrases (CAPs): (learn more)
Public Sub, Public Function, Public Class, Next Console, End If Next Return, Else Console, Imports System, Get Return, Else Dim, Visual Basic, False Infinity, David Durr, End If Console, End If Return, Implements System, Click Dim, Private Const, End Get End Property Public, Left Is Nothing, New Integer, Next For Each, Rewrite Exercise, Right Is Nothing, Vertex Visited Weight Via Path, Raymond Williams New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
setl intersection, advanced sorting algorithms, custom collection class, circularly linked list, iterator class, skip list, grades array, header node, hash table implementation, jagged array, queue class, initialization list, binary search method, timing code, grouping constructs, insert method, linear collection, constructor method, insertion sort, binary search algorithm, deleted node, topological sorting, binary search tree, dynamic programming solution, selection sort Key Phrases - Capitalized Phrases (CAPs): (learn more)
Public Sub, Public Function, Public Class, Next Console, End If Next Return, Else Console, Imports System, Get Return, Else Dim, Visual Basic, False Infinity, David Durr, End If Console, End If Return, Implements System, Click Dim, Private Const, End Get End Property Public, Left Is Nothing, New Integer, Next For Each, Rewrite Exercise, Right Is Nothing, Vertex Visited Weight Via Path, Raymond Williams New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 7
books:
See all 7 books this book cites
- Data Structures and Algorithm Analysis (2nd Edition) by Mark Allen Weiss on page 247, and Back Matter
- Data Structures and Algorithm Analysis in Java (2nd Edition) by Mark A. Weiss on page 247, and Back Matter
- Object-Oriented Programming with Visual Basic.NET by Michael McMillan in Front Matter, and Back Matter
- Programming Pearls (2nd Edition) by Jon Bentley on page 149, and Back Matter
- Mastering Regular Expressions by Jeffrey E.F. Friedl on page 198
See all 7 books this book cites
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
|
|
Look for Similar Items by Category
- Books > Computers & Technology > Microsoft > Development > .NET
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Languages & Tools > Visual Basic
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Object-Oriented Design
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > Computers & Technology > Software
- Books > Science & Math > Mathematics
