C# data structures and algorithms : explore the possibilities of C# for developing a variety of efficient applications / Marcin Jamro.

Format:

Book

Author/Creator:

Jamro, Marcin, author.

Language:

English

Subjects (All):

C# (Computer program language).

Application software--Development.

Application software.

Data structures (Computer science).

Physical Description:

1 online resource (1 volume) : illustrations

Edition:

1st edition

Other Title:

C sharp data structures and algorithms

Place of Publication:

Birmingham ; Mumbai : Packt Publishing, 2018.

System Details:

Mode of access: World Wide Web.

text file

Biography/History:

Jamro Marcin: Marcin Jamro, PhD, DSc (dr hab. inz. Marcin Jamro) is a reliable entrepreneur, a helpful expert, and an experienced developer, with significant international experience. He held the role of CEO at a few technological companies, operated as CTO at companies in various countries, and also worked at Microsoft Corporation in Redmond, USA. Marcin shares his knowledge as an expert in international projects and invests in modern solutions. He is the author of a few books on software engineering, as well as the author of numerous publications. The results of his research were presented and discussed at many scientific conferences. He has MCPD, MCTS, MCP, and CAE certificates. Marcin is a multiple laureate, finalist, and mentor in various competitions. He received the Primus Inter Pares medal and also, a few times, a scholarship for the Minister of Science and Higher Education for scientific achievements. Marcin has significant experience in project development, especially with the C# language and. NET-based technologies. He has performed the role of lead architect on numerous complex software projects, including web and mobile applications, APIs, databases, and integration with external components.

Summary:

A complete guide on using data structures and algorithms to write sophisticated C# code About This Book Master array, set and map with trees and graphs, among other fundamental data structures Delve into effective design and implementation techniques to meet your software requirements Explore illustrations to present data structures and algorithms, as well as their analysis in a clear, visual manner. Who This Book Is For This book is for developers who would like to learn the Data Structures and Algorithms in C#. Basic C# programming knowledge would be an added advantage. What You Will Learn How to use arrays and lists to get better results in complex scenarios Implement algorithms like the Tower of Hanoi on stacks of C# objects Build enhanced applications by using hashtables, dictionaries and sets Make a positive impact on efficiency of applications with tree traversal Effectively find the shortest path in the graph In Detail Data structures allow organizing data efficiently. They are critical to various problems and 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. At the beginning, you will get to know arrays, lists, dictionaries, and sets together with real-world examples of your application. Then, you will learn how to create and use stacks and queues. In the following part of the book, the more complex data structures will be introduced, namely trees and graphs, together with some algorithms for searching the shortest path in a graph. We will also discuss how to organize the code in a manageable, consistent, and extendable way. By the end of the book,you will learn how to build components that are easy to understand, debug, and use in different applications. Style and approach Readers will be taken through all the indispensable data structures and algorithms so they can begin their coding journey in C#. At each step, the book will show how to implement these via examples while also discussing the attributes of each algorithm so readers are capable to make an informed choice. Downloading the example code for this book You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com. If you purchased this book elsewhere, you can visit http://www.Pac...

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 arrays

Example - 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

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

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

Chapter 5: Variants of Trees

Basic trees

Node

Tree

Example - hierarchy of identifiers

Example - company structure

Binary trees

Tree.

Example - simple quiz

Binary search trees

Lookup

Insertion

Removal

Example - BST visualization

AVL trees

Example - keep the tree balanced

Red-black trees

Example - RBT-related features

Binary heaps

Example - heap sort

Binomial heaps

Fibonacci heaps

Chapter 6: Exploring Graphs

Concept of graphs

Applications

Representation

Adjacency list

Adjacency matrix

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

Chapter 7: Summary

Classification of data structures

Diversity of applications

Lists

Sets

Trees

Heaps

Graphs

The last word

Other Books You May Enjoy

Index.

Notes:

Includes bibliographical references and index.

Description based on print version record.

ISBN:

9781788834681

1788834682

OCLC:

1035957695