Explore Go programming, understanding its concurrency advantages over traditional languages. Gain insights into why Go is crucial as Moore’s Law fades, suitable for beginners.

go.tar.gz

GOPATH

runGoWithPackage

bash

As Moore’s Law is reaching the end of its lifecycle, the need for concurrency is rising and consequently, the need for a programming language that enables effective implementation of concurrent programs is rising too. For this reason, Go has become one of the most popular languages in recent times. This course aims to provide a detailed introduction to Go for beginners. Furthermore, it also articulates how Go is different from traditional programming languages that programmers are accustomed to in order to acquaint programmers getting ready to delve into Go with the language too.

An Introduction to Programming in Go

## Introduction

Concurrent programming is a large topic, ​but it's also one of the most
interesting aspects of the Go language.

Concurrent programming in many environments is made difficult by the subtleties required to implement correct access to *shared variables*. Go encourages a different approach in which shared values are passed around on channels and, in fact, never actively shared by separate threads of execution. Only one goroutine has access to the value at any given time. 

Data races cannot occur, by design. To encourage this way of thinking we have reduced it to a slogan:

>Do not communicate by sharing memory; instead, share memory by communicating.

This approach can be taken too far. Reference counts may be best done by putting a *mutex* around an integer variable, for instance. But as a high-level approach, using channels to control access makes it easier to write clear, correct programs.

Although Go's approach to concurrency originates in [Hoare's Communicating Sequential Processes (CSP)](http://en.wikipedia.org/wiki/Communicating_sequential_processes), it can also be seen as a type-safe generalization of Unix pipes.

* [Rob Pike's concurrency slides (IO 2012)](http://talks.golang.org/2012/concurrency.slide#1)
* [Video of Rob Pike at IO 2012](http://www.youtube.com/watch?v=f6kdp27TYZs)
* [Video of Concurrency is not parallelism (Rob Pike)](http://vimeo.com/49718712)

# Introduction

Concurrent programming is a large topic, ​but it's also one of the most
interesting aspects of the Go language.

Concurrent programming in many environments is made difficult by the subtleties required to implement correct access to *shared variables*. Go encourages a different approach in which shared values are passed around on channels and, in fact, never actively shared by separate threads of execution. Only one goroutine has access to the value at any given time. 

Data races cannot occur, by design. To encourage this way of thinking we have reduced it to a slogan:

>Do not communicate by sharing memory; instead, share memory by communicating.

This approach can be taken too far. Reference counts may be best done by putting a *mutex* around an integer variable, for instance. But as a high-level approach, using channels to control access makes it easier to write clear, correct programs.

Although Go's approach to concurrency originates in [Hoare's Communicating Sequential Processes (CSP)](http://en.wikipedia.org/wiki/Communicating_sequential_processes), it can also be seen as a type-safe generalization of Unix pipes.

* [Rob Pike's concurrency slides (IO 2012)](http://talks.golang.org/2012/concurrency.slide#1)
* [Video of Rob Pike at IO 2012](http://www.youtube.com/watch?v=f6kdp27TYZs)
* [Video of Concurrency is not parallelism (Rob Pike)](http://vimeo.com/49718712)

This lesson introduces the concept of concurrent programming

The Basics

Types

Collection Types

Control flow

Methods

Interfaces

Concurrency

Get Setup

Online Coding Challenges

Tips & Tricks

Concurrent Programming

Introduction