|
|
|
|
LEADER |
00000cam a2200000Ma 4500 |
001 |
EBOOKCENTRAL_on1034622819 |
003 |
OCoLC |
005 |
20240329122006.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
|
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
|
029 |
1 |
|
|a CHNEW
|b 001016217
|
029 |
1 |
|
|a CHVBK
|b 523132085
|
029 |
1 |
|
|a UKMGB
|b 018853902
|
029 |
1 |
|
|a AU@
|b 000067107703
|
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 |
0 |
4 |
|a 005.133
|2 23
|
049 |
|
|
|a UAMI
|
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.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
650 |
|
0 |
|a C# (Computer program language)
|
650 |
|
0 |
|a Application software
|x Development.
|
650 |
|
0 |
|a Data structures (Computer science)
|
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
|
758 |
|
|
|i has work:
|a C# DATA STRUCTURES AND ALGORITHMS (Text)
|1 https://id.oclc.org/worldcat/entity/E39PD3dyh3TPhxv9dwfyqT3GBK
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
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 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=5371688
|z Texto completo
|
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 IZTAP
|