C# Data Structures and Algorithms Explore the possibilities of C# for developing a variety of efficient applications.
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 algor...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Birmingham
Packt Publishing,
2018.
|
| Subjects: | |
| Online Access: | EBSCOhost Перейти в каталог НБ ТГУ |
| LEADER | 04851cam a2200529Ma 4500 | ||
|---|---|---|---|
| 001 | koha001012943 | ||
| 003 | OCoLC | ||
| 005 | 20250222065943.0 | ||
| 006 | m d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 180505s2018 enk o 000 0 eng d | ||
| 035 | |a koha001012943 | ||
| 040 | |a EBLCP |b eng |c EBLCP |d MERUC |d IDB |d CHVBK |d OCLCO |d OCLCF |d VT2 |d NLE |d N$T |d OCLCO | ||
| 020 | |a 9781788834681 |q (electronic bk.) | ||
| 020 | |a 1788834682 |q (electronic bk.) | ||
| 020 | |z 9781788833738 | ||
| 020 | |z 1788833732 | ||
| 020 | |a 1788833732 | ||
| 020 | |a 9781788833738 | ||
| 037 | |a B09540 |b 01201872 | ||
| 050 | 4 | |a QA76.73.C154 |b .J367 2018eb | |
| 072 | 7 | |a COM |x 051310 |2 bisacsh | |
| 082 | 0 | 4 | |a 005.133 |2 23 |
| 049 | |a MAIN | ||
| 100 | 1 | |a Jamro, Marcin. |9 910653 | |
| 245 | 1 | 0 | |a C# Data Structures and Algorithms |h [electronic resource] |b Explore the possibilities of C# for developing a variety of efficient applications. |
| 260 | |a Birmingham |b Packt Publishing, |c 2018. |9 910652 | ||
| 300 | |a 1 online resource (287 p.) | ||
| 500 | |a Description based upon print version of record. | ||
| 505 | 0 | |a 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 | |
| 505 | 8 | |a 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 | |
| 505 | 8 | |a 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 | |
| 505 | 8 | |a 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 | |
| 505 | 8 | |a 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 | |
| 520 | |a 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. | ||
| 653 | 0 | |a C# (Computer program language) | |
| 653 | 0 | |a Application software |x Development. | |
| 653 | 0 | |a Data structures (Computer science) | |
| 653 | 7 | |a COMPUTERS / Programming Languages / C#. |2 bisacsh | |
| 653 | 7 | |a Application software |x Development. |2 fast |0 (OCoLC)fst00811707 | |
| 655 | 0 | |a EBSCO eBooks |9 905790 | |
| 655 | 4 | |a Electronic books. |9 899821 | |
| 856 | 4 | 0 | |3 EBSCOhost |u https://www.lib.tsu.ru/limit/2023/EBSCO/1801029.pdf |
| 856 | |y Перейти в каталог НБ ТГУ |u https://koha.lib.tsu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=1012943 | ||
| 910 | |a EBSCO eBooks | ||
| 999 | |c 1012943 |d 1012943 | ||
| 039 | |||