📄️ overview
programming Language developed at Google in 2007
📄️ why Go was developd ?
the possible Question is you hear another programming language
📄️ installation and local Dev Enviroment
To install Go on your local machine, follow these steps:
📄️ Basic Struture of a Go file
- first program and file structure
📄️ Varibles and Constats
In Go, a variable is a storage location that holds a value of a specific type. You can use variables to store values such as numbers, strings, and more.
📄️ Data Types
Go has several built-in data types, including:
📄️ Pointer:
Pointer type in Go is a type that stores the memory address of a value. It is represented by the " * " symbol followed by the type of the value it points to. For example, a pointer to an integer would be represented as "*int".
📄️ user input/output
The fmt package in Go provides a variety of functions for formatting and printing text. It is a standard library package, so you can use it without installing any additional dependencies.
📄️ control statement
- loops
📄️ function
- Functions
📄️ Concurrency
In the context of programming, concurrency is often used to improve the performance and scalability of programs by allowing them to perform multiple tasks simultaneously. For example, a program that performs a long-running computation can use concurrency to also handle user input or network requests while the computation is being performed.
📄️ Arrays:
An array is a fixed-size collection of elements of the same type. The size of the array is set when it is created and cannot be changed. Arrays can be accessed using their index, and they are 0-indexed, meaning that the first element is at index 0.
📄️ Slices:
A slice is a variable-size collection of elements of the same type. Unlike arrays, slices can be resized and have a capacity, which is the number of elements that can be stored in the slice before it needs to be reallocated.
📄️ map
Maps:
📄️ linkedlist
To understand linked lists, it's helpful to have a basic understanding of the following concepts:
📄️ hashtbl
A hash table is a data structure that is used to store keys and values. It uses a hash function to map the key to an index in an array, and stores the value at that index.