Карточка | Таблица | RUSMARC | |
Jamro, Marcin. C# Data Structures and Algorithms [[electronic resource]]: Explore the possibilities of C# for developing a variety of efficient applications. — Birmingham: Packt Publishing, 2018. — 1 online resource (287 p.). — Description based upon print version of record. — <URL:http://elib.fa.ru/ebsco/1801029.pdf>.Дата создания записи: 05.05.2018 Тематика: C# (Computer program language); Application software — Development.; Data structures (Computer science); COMPUTERS / Programming Languages / C#.; Application software — Development. Коллекции: EBSCO Разрешенные действия: –
Действие 'Прочитать' будет доступно, если вы выполните вход в систему или будете работать с сайтом на компьютере в другой сети
Действие 'Загрузить' будет доступно, если вы выполните вход в систему или будете работать с сайтом на компьютере в другой сети
Группа: Анонимные пользователи Сеть: Интернет |
Аннотация
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.
Права на использование объекта хранения
Место доступа | Группа пользователей | Действие | ||||
---|---|---|---|---|---|---|
Локальная сеть Финуниверситета | Все | |||||
Интернет | Читатели | |||||
Интернет | Анонимные пользователи |
Оглавление
- 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
- Value types
- 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 arrays
- Example – yearly transport plan
- Single-dimensional arrays
- 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
- Arrays
- 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 support
- Summary
- Stacks
- 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
- Hash tables
- Chapter 5: Variants of Trees
- Basic trees
- Implementation
- Node
- Tree
- Example – hierarchy of identifiers
- Example – company structure
- Implementation
- Binary trees
- Implementation
- Node
- Tree
- Example – simple quiz
- Implementation
- Binary search trees
- Implementation
- Node
- Tree
- Lookup
- Insertion
- Removal
- Example – BST visualization
- Implementation
- 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
- Basic trees
- 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 algorithm
- Example – 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
Статистика использования
Количество обращений: 0
За последние 30 дней: 0 Подробная статистика |