Computer Programming Ebooks collection

Chapter 1 introduces the reverend to the construct of the accumulation scheme as a assemblage of data. The concepts of linelike and nonlinear collections are introduced. The Collection collection is demonstrated. This chapter also introduces the construct of generic programming, which allows the technologist to indite digit class, or digit method, and hit it impact for a assemblage of accumulation types. Generic planning is an essential newborn constituent to C# (available in C# 2.0 and beyond), so much so that there is a direct accumulation of generic accumulation structures institute in theSystem.Collections.Generic namespace. When a accumulation scheme has a generic feat institute in this library, its ingest is discussed. The chapter ends with an launching to methods of activity the action of the accumulation structures and algorithms discussed in the book.
Chapter 2 provides a analyse of how arrays are constructed, along with demonstrating the features of the Array class. The Array collection encapsulates some of the functions related with arrays (UBound, LBound, and so on) into a azygos package. ArrayLists are direct types of arrays that wage impulsive resizing capabilities.
Chapter 3 is an launching to the base operation algorithms, much as the eruct variety and the intromission sort, and Chapter 4 examines the most basic algorithms for intelligent memory, the sequential and star searches.
Two artist accumulation structures are examined in Chapter 5: the arrange and the queue. The inflection in this chapter is on the applicatory ingest of these accumulation structures in finding routine problems in accumulation processing.
Chapter 6 covers the BitArray class, which crapper be utilised to expeditiously equal a super sort of number values, much as effort scores.
Strings are not commonly awninged in a accumulation structures book, but Chapter 7 covers strings, the String class, and the StringBuilder class. Because so much accumulation processing in C# is performed on strings, the reverend should be unclothed to the direct techniques institute in the digit classes.
Chapter 8 examines the ingest of lawful expressions for book processing and ornament matching. Regular expressions ofttimes wage more noesis and efficiency than crapper be had with more tralatitious progress functions and methods.
Chapter 9 introduces the reverend to the ingest of dictionaries as accumulation structures. Dictionaries, and the assorted accumulation structures supported on them, accumulation accumulation as key/value pairs. This chapter shows the reverend how to create his or her own
classes supported on the DictionaryBase class, which is an nonfigurative class.
Chapter 10 covers hash tables and the HashTable class, which is a direct identify of lexicon that uses a hashing formula for storing accumulation internally.
Another artist accumulation structure, the linked list, is awninged in Chapter 11. Linked lists are not as essential a accumulation scheme in C# as they are in a pointer-based module much as C++, but they ease hit a persona in C# programming.
Chapter 12 introduces the reverend to still added artist accumulation structure—the star tree. A special identify of star tree, the star see tree, is the direct matter of the chapter. Other types of star trees are awninged in Chapter 15.
Chapter 13 shows the reverend how to accumulation accumulation in sets, which crapper be multipurpose in situations in which exclusive unequalled accumulation values crapper be stored in the accumulation structure.
Chapter 14 covers more modern operation algorithms, including the favourite and economical QuickSort, which is the foundation for most of the operation procedures implemented in the .NET Framework library.
Chapter 15 looks at threesome accumulation structures that establish multipurpose for intelligent when a star see tree is not titled for: the AVL tree, the red-black tree, and the resile list.
Chapter 16 discusses graphs and interpret algorithms. Graphs are multipurpose for representing some assorted types of data, especially networks.
Finally, Chapter 17 introduces the reverend to what formula organisation techniques rattling are: impulsive algorithms and greedy algorithms.