IDG Code Night C#

Get Started. It's Free
or sign up with your email address
Rocket clouds
IDG Code Night C# by Mind Map: IDG Code Night C#

1. Tutorials for people new to C#

2. Installing

2.1. .NET Core

2.2. Visual Studio Code

2.3. Docker

3. .NET Core Tutorials

3.1. Getting started with .NET Core on Windows, using Visual Studio 2015

3.2. Getting started with .NET Core on macOS, using Visual Studio Code

3.3. Getting started with .NET Core on Windows/Linux/macOS using the command line

3.4. Building Docker Images for .NET Core Applications

3.5. Unit Testing in .NET Core using dotnet test

3.6. Getting Started with Visual Studio Code

3.7. Building a C# Hello World application with .NET Core in Visual Studio 2017 RC

4. ASP.NET Core Tutorials

4.1. Your First ASP.NET Core Application on a Mac Using Visual Studio Code

4.2. Building your first ASP.NET Core MVC app with Visual Studio

4.3. Building Your First Web API with ASP.NET Core MVC and Visual Studio

4.4. Getting started with ASP.NET Core and Entity Framework Core using Visual Studio

4.5. Getting started with EF Core + Sqlite + Asp.Net core Web api on Mac

4.6. Deploy an ASP.NET Core web app to Azure using Visual Studio

4.7. Enabling authentication using Facebook, Google and other external providers

4.8. Building projects with Yeoman

4.9. Building an (awesome) API with NancyFX 2.0 + Dapper

4.10. ASP.NET Core Workshop

5. Code Challanges

5.1. Write an efficient function to find the first nonrepeated character in a string. For instance, the first nonrepeated character in “total” is 'o' and the first nonrepeated character in “teeter” is 'r'.

5.2. Implement a routine that prints all possible orderings of the characters in a string. In other words, print all permutations that use all the characters from the original string. For example, given the string “hat”, your function should print the strings “tha”, “aht”, “tah”, “ath”, “hta”, and “hat”. Treat each character in the input string as a distinct character, even if it is repeated. Given the string “aaa”, your routine should print “aaa” six times. You may print the permutations in any order you choose.

5.3. Implement an efficient version of the quicksort algorithm.

5.3.1. https://en.wikipedia.org/wiki/Quicksort

5.4. Build a weather service for Stockholm

5.4.1. http://opendata.smhi.se/apidocs/metfcst/index.html

5.4.2. https://www.nuget.org/packages/Rest.Net/

5.4.3. https://www.nuget.org/packages/Newtonsoft.Json/9.0.2-beta2

6. Presenters

6.1. Filip Ekberg

6.2. Dag König