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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Birmingham :
Packt Publishing,
2018.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (287 pages) |
| ISBN: | 9781788834681 1788834682 1788833732 9781788833738 |
Internformat
MARC
| LEADER | 00000cam a2200000Ma 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-on1034622819 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 180505s2018 enk o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d MERUC |d IDB |d CHVBK |d OCLCO |d OCLCF |d VT2 |d NLE |d N$T |d OCLCO |d TEFOD |d OCLCQ |d UKMGB |d LVT |d C6I |d OCL |d UKAHL |d OCLCQ |d UX1 |d K6U |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d TMA |d OCLCQ |d SXB |d OCLCQ | ||
| 015 | |a GBB882213 |2 bnb | ||
| 016 | 7 | |a 018853902 |2 Uk | |
| 019 | |a 1175637438 | ||
| 020 | |a 9781788834681 |q (electronic bk.) | ||
| 020 | |a 1788834682 |q (electronic bk.) | ||
| 020 | |a 1788833732 | ||
| 020 | |a 9781788833738 | ||
| 020 | |z 1788833732 | ||
| 020 | |z 9781788833738 | ||
| 024 | 3 | |a 9781788833738 | |
| 035 | |a (OCoLC)1034622819 |z (OCoLC)1175637438 | ||
| 037 | |a B09540 |b 01201872 | ||
| 037 | |a 8A3DD13E-4FF6-46D9-A342-15BABB4D48CD |b OverDrive, Inc. |n http://www.overdrive.com | ||
| 050 | 4 | |a QA76.73.C154 |b .J367 2018eb | |
| 072 | 7 | |a COM |x 051310 |2 bisacsh | |
| 082 | 7 | |a 005.133 |2 23 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Jamro, Marcin. | |
| 245 | 1 | 0 | |a C# Data Structures and Algorithms : |b Explore the possibilities of C# for developing a variety of efficient applications. |
| 260 | |a Birmingham : |b Packt Publishing, |c 2018. | ||
| 300 | |a 1 online resource (287 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 588 | 0 | |a Print version 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. | ||
| 650 | 0 | |a C# (Computer program language) |0 http://id.loc.gov/authorities/subjects/sh2001001705 | |
| 650 | 0 | |a Application software |x Development. |0 http://id.loc.gov/authorities/subjects/sh95009362 | |
| 650 | 0 | |a Data structures (Computer science) |0 http://id.loc.gov/authorities/subjects/sh85035862 | |
| 650 | 6 | |a C# (Langage de programmation) | |
| 650 | 6 | |a Logiciels d'application |x Développement. | |
| 650 | 6 | |a Structures de données (Informatique) | |
| 650 | 7 | |a COMPUTERS |x Programming Languages |x C#. |2 bisacsh | |
| 650 | 7 | |a Data structures (Computer science) |2 fast | |
| 650 | 7 | |a C# (Computer program language) |2 fast | |
| 650 | 7 | |a Application software |x Development |2 fast | |
| 655 | 4 | |a Electronic book. | |
| 776 | 0 | 8 | |i Print version: |a Jamro, Marcin. |t C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. |d Birmingham : Packt Publishing, ©2018 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1801029 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH34379621 | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL5371688 | ||
| 938 | |a EBSCOhost |b EBSC |n 1801029 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-on1034622819 |
|---|---|
| _version_ | 1816882420882866177 |
| adam_text | |
| any_adam_object | |
| author | Jamro, Marcin |
| author_facet | Jamro, Marcin |
| author_role | |
| author_sort | Jamro, Marcin |
| author_variant | m j mj |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.73.C154 .J367 2018eb |
| callnumber-search | QA76.73.C154 .J367 2018eb |
| callnumber-sort | QA 276.73 C154 J367 42018EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| 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. 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. 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. 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. |
| ctrlnum | (OCoLC)1034622819 |
| dewey-full | 005.133 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.133 |
| dewey-search | 005.133 |
| dewey-sort | 15.133 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05859cam a2200685Ma 4500</leader><controlfield tag="001">ZDB-4-EBA-on1034622819</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">180505s2018 enk o 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">MERUC</subfield><subfield code="d">IDB</subfield><subfield code="d">CHVBK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCF</subfield><subfield code="d">VT2</subfield><subfield code="d">NLE</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCO</subfield><subfield code="d">TEFOD</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKMGB</subfield><subfield code="d">LVT</subfield><subfield code="d">C6I</subfield><subfield code="d">OCL</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UX1</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">TMA</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">SXB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBB882213</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">018853902</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">1175637438</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781788834681</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1788834682</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1788833732</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781788833738</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1788833732</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781788833738</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9781788833738</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1034622819</subfield><subfield code="z">(OCoLC)1175637438</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">B09540</subfield><subfield code="b">01201872</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">8A3DD13E-4FF6-46D9-A342-15BABB4D48CD</subfield><subfield code="b">OverDrive, Inc.</subfield><subfield code="n">http://www.overdrive.com</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.73.C154</subfield><subfield code="b">.J367 2018eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051310</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">005.133</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jamro, Marcin.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">C# Data Structures and Algorithms :</subfield><subfield code="b">Explore the possibilities of C# for developing a variety of efficient applications.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Birmingham :</subfield><subfield code="b">Packt Publishing,</subfield><subfield code="c">2018.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (287 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">C# (Computer program language)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2001001705</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Application software</subfield><subfield code="x">Development.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh95009362</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Data structures (Computer science)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85035862</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">C# (Langage de programmation)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Logiciels d'application</subfield><subfield code="x">Développement.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Structures de données (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Programming Languages</subfield><subfield code="x">C#.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data structures (Computer science)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">C# (Computer program language)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Application software</subfield><subfield code="x">Development</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic book.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Jamro, Marcin.</subfield><subfield code="t">C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications.</subfield><subfield code="d">Birmingham : Packt Publishing, ©2018</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1801029</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH34379621</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL5371688</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">1801029</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic book. |
| genre_facet | Electronic book. |
| id | ZDB-4-EBA-on1034622819 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:28:20Z |
| institution | BVB |
| isbn | 9781788834681 1788834682 1788833732 9781788833738 |
| language | English |
| oclc_num | 1034622819 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (287 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Packt Publishing, |
| record_format | marc |
| spelling | Jamro, Marcin. C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. Birmingham : Packt Publishing, 2018. 1 online resource (287 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Print version record. 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. 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. 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. 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. 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. C# (Computer program language) http://id.loc.gov/authorities/subjects/sh2001001705 Application software Development. http://id.loc.gov/authorities/subjects/sh95009362 Data structures (Computer science) http://id.loc.gov/authorities/subjects/sh85035862 C# (Langage de programmation) Logiciels d'application Développement. Structures de données (Informatique) COMPUTERS Programming Languages C#. bisacsh Data structures (Computer science) fast C# (Computer program language) fast Application software Development fast Electronic book. Print version: Jamro, Marcin. C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. Birmingham : Packt Publishing, ©2018 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1801029 Volltext |
| spellingShingle | Jamro, Marcin C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. 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. 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. 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. 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. C# (Computer program language) http://id.loc.gov/authorities/subjects/sh2001001705 Application software Development. http://id.loc.gov/authorities/subjects/sh95009362 Data structures (Computer science) http://id.loc.gov/authorities/subjects/sh85035862 C# (Langage de programmation) Logiciels d'application Développement. Structures de données (Informatique) COMPUTERS Programming Languages C#. bisacsh Data structures (Computer science) fast C# (Computer program language) fast Application software Development fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh2001001705 http://id.loc.gov/authorities/subjects/sh95009362 http://id.loc.gov/authorities/subjects/sh85035862 |
| title | C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. |
| title_auth | C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. |
| title_exact_search | C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. |
| title_full | C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. |
| title_fullStr | C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. |
| title_full_unstemmed | C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. |
| title_short | C# Data Structures and Algorithms : |
| title_sort | c data structures and algorithms explore the possibilities of c for developing a variety of efficient applications |
| title_sub | Explore the possibilities of C# for developing a variety of efficient applications. |
| topic | C# (Computer program language) http://id.loc.gov/authorities/subjects/sh2001001705 Application software Development. http://id.loc.gov/authorities/subjects/sh95009362 Data structures (Computer science) http://id.loc.gov/authorities/subjects/sh85035862 C# (Langage de programmation) Logiciels d'application Développement. Structures de données (Informatique) COMPUTERS Programming Languages C#. bisacsh Data structures (Computer science) fast C# (Computer program language) fast Application software Development fast |
| topic_facet | C# (Computer program language) Application software Development. Data structures (Computer science) C# (Langage de programmation) Logiciels d'application Développement. Structures de données (Informatique) COMPUTERS Programming Languages C#. Application software Development Electronic book. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1801029 |
| work_keys_str_mv | AT jamromarcin cdatastructuresandalgorithmsexplorethepossibilitiesofcfordevelopingavarietyofefficientapplications |