| Document Type
|
:
|
BL
|
| Record Number
|
:
|
856579
|
| Main Entry
|
:
|
Jamro, Marcin.
|
| Title & Author
|
:
|
C# Data Structures and Algorithms : : Explore the possibilities of C# for developing a variety of efficient applications.
|
| Publication Statement
|
:
|
Birmingham :: Packt Publishing,, 2018.
|
| Page. NO
|
:
|
1 online resource (287 pages)
|
| ISBN
|
:
|
1788833732
|
|
|
:
|
: 1788834682
|
|
|
:
|
: 9781788833738
|
|
|
:
|
: 9781788834681
|
|
|
:
|
1788833732
|
|
|
:
|
9781788833738
|
| Contents
|
:
|
Cover; Title Page; Copyright and Credits; Packt Upsell; Contributors; Table of Contents; Preface; Chapter 1: Getting Started; Programming language; Data types; Value types; Structs; Enumerations; Reference types; Strings; Object; Dynamic; Classes; Interfaces; Delegates; Installation and configuration of the IDE; Creating the project; Input and output; Reading from input; Writing to output; Launching and debugging; Summary; Chapter 2: Arrays and Lists; Arrays; Single-dimensional arrays; Example -- month names; Multi-dimensional arrays; Example -- multiplication table; Example -- game map.
|
|
|
:
|
Example -- call center with priority supportSummary; Chapter 4: Dictionaries and Sets; Hash tables; Example -- phone book; Dictionaries; Example -- product location; Example -- user details; Sorted dictionaries; Example -- definitions; Hash sets; Example -- coupons; Example -- swimming pools; Sorted"" sets; Example -- removing duplicates; Summary; Chapter 5: Variants of Trees; Basic trees; Implementation; Node; Tree; Example -- hierarchy of identifiers; Example -- company structure; Binary trees; Implementation; Node; Tree; Example -- simple quiz; Binary search trees; Implementation; Node; Tree; Lookup.
|
|
|
:
|
InsertionRemoval; Example -- BST visualization; AVL trees; Implementation; Example -- keep the tree balanced; Red-black trees; Implementation; Example -- RBT-related features; Binary heaps; Implementation; Example -- heap sort; Binomial heaps; Fibonacci heaps; Summary; Chapter 6: Exploring Graphs; Concept of graphs; Applications; Representation; Adjacency list; Adjacency matrix; Implementation; Node; Edge; Graph; Example -- undirected and unweighted edges; Example -- directed and weighted edges; Traversal; Depth-first search; Breadth-first search; Minimum spanning tree; Kruskal's algorithm.
|
|
|
:
|
Jagged arraysExample -- yearly transport plan; Sorting algorithms; Selection sort; Insertion sort; Bubble sort; Quicksort; Simple lists; Array list; Generic list; Example -- average value; Example -- list of people; Sorted lists; Example -- address book; Linked lists; Example -- book reader; Circular-linked lists; Implementation; Example -- spin the wheel; Summary; Chapter 3: Stacks and Queues; Stacks; Example -- reversing words; Example -- Tower of Hanoi; Queues; Example -- call center with a single consultant; Example -- call center with many consultants; Priority queues.
|
|
|
:
|
Prim's algorithmExample -- telecommunication cable; Coloring; Example -- voivodeship map; Shortest path; Example -- game map; Summary; Chapter 7: Summary; Classification of data structures; Diversity of applications; Arrays; Lists; Stacks; Queues; Dictionaries; Sets; Trees; Heaps; Graphs; The last word; Other Books You May Enjoy; Index.
|
| Abstract
|
:
|
Data structures allow organizing data efficiently. Their suitable implementation can provide a complete solution that acts like reusable code. In this book, you will learn how to use various data structures while developing in the C# language as well as how to implement some of the most common algorithms used with such data structures.
|
| Subject
|
:
|
Application software-- Development.
|
| Subject
|
:
|
C# (Computer program language)
|
| Subject
|
:
|
Data structures (Computer science)
|
| Subject
|
:
|
Application software-- Development.
|
| Subject
|
:
|
C# (Computer program language)
|
| Subject
|
:
|
COMPUTERS-- Programming Languages-- C#.
|
| Subject
|
:
|
Data structures (Computer science)
|
| Dewey Classification
|
:
|
005.133
|
| LC Classification
|
:
|
QA76.73.C154.J367 2018eb
|