Go is an open-source programming language developed by Google<\/span><\/span>. It is designed for simplicity, concurrency, fast compilation, and scalability.<\/p>\n Goroutines are lightweight threads managed by the Go runtime.<\/p>\n Example:<\/p>\n Channels are used for communication between goroutines.<\/p>\n Example:<\/p>\n \/\/ Create an unbuffered channel of ints<\/p>\n ch := make(chan int)\u00a0\u00a0 \/\/ capacity = 0\u00a0 \u2192 every send blocks until a receive<\/p>\n go func() {<\/p>\n ch <- 42\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ blocks here until the main goroutine receives<\/p>\n }()<\/p>\n v := <-ch\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ unblocks the sender, value is now 42<\/p>\n fmt.Println(v)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Output: 42<\/p>\n ch <- 1\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ does not block yet<\/p>\n ch <- 2<\/p>\n ch <- 3\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ still fine: buffer now full<\/p>\n \/\/ ch <- 4 would block because the buffer is full<\/p>\n fmt.Println(<-ch)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ prints 1, frees one slot<\/p>\n ch <- 4\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ now this send succeeds immediately<\/p>\n Key points<\/em><\/p>\n <\/p>\n Handling multiple tasks at the same time.<\/p>\n Executing multiple tasks simultaneously using multiple CPUs.<\/p>\n Go supports both using goroutines.<\/p>\n Example:<\/p>\n Pointers store memory addresses.<\/p>\n Example:<\/p>\n Allocates memory and returns pointer.<\/p>\n Initializes slices, maps, and channels.<\/p>\nKey advantages:<\/h3>\n
\n
\n2. What are goroutines?<\/h2>\n
go<\/span> myFunction<\/span>()<\/code><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n
\n3. What is a channel in Go?<\/h2>\n
ch<\/span> :=<\/span> make(chan<\/span> int<\/span>)<\/code><\/div>\n<\/div>\n<\/div>\n\r\ngo<\/span> func<\/span>() {\r\n ch<\/span> <-<\/span> 10<\/span>\r\n}()\r\n\r\nvalue<\/span> :=<\/span> <-<\/span>ch<\/span>\r\nfmt<\/span>.<\/span>Println(value<\/span>)<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n
\n4. Difference between buffered and unbuffered channels?<\/h2>\n
Unbuffered Channel<\/h3>\n
\n
ch<\/span> :=<\/span> make(chan<\/span> int<\/span>)<\/code><\/div>\n<\/div>\n<\/div>\n\n\n
\n <\/td>\n Unbuffered (make(chan T))<\/strong><\/td>\n<\/tr>\n<\/thead>\n\n \n Capacity<\/td>\n 0<\/td>\n<\/tr>\n \n Send (ch <- v)<\/td>\n Blocks<\/strong> until some goroutine receives<\/td>\n<\/tr>\n \n Receive (<-ch)<\/td>\n Blocks<\/strong> until some goroutine sends<\/td>\n<\/tr>\n \n Typical uses<\/td>\n Hand\u2011off \/ rendezvous, strict sequencing<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n <\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n
ch<\/span> :=<\/span> make(chan<\/span> int<\/span>, 3<\/span>)<\/code><\/div>\n<\/div>\n\n\n
\n <\/td>\n Buffered (make(chan T, n))<\/strong><\/td>\n<\/tr>\n<\/thead>\n\n \n Capacity<\/td>\n n\u202f>\u202f0<\/td>\n<\/tr>\n \n Send (ch <- v)<\/td>\n Blocks only<\/strong> when buffer is full<\/td>\n<\/tr>\n \n Receive (<-ch)<\/td>\n Blocks only<\/strong> when buffer is empty<\/td>\n<\/tr>\n \n Typical uses<\/td>\n Smooth out bursts, worker pools, rate limiting<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n \n\n
\n Feature<\/strong><\/td>\n Unbuffered Channel<\/strong><\/td>\n Buffered Channel<\/strong><\/td>\n<\/tr>\n<\/thead>\n\n \n Blocking behavior<\/td>\n Sender blocks until receiver receives<\/strong><\/td>\n Sender only blocks when buffer is full<\/strong><\/td>\n<\/tr>\n \n Synchronization<\/td>\n Provides direct handoff<\/strong><\/td>\n Acts like a queue<\/strong><\/td>\n<\/tr>\n \n Capacity<\/td>\n make(chan T)<\/td>\n make(chan T, N) (N > 0)<\/td>\n<\/tr>\n \n Common use case<\/td>\n Safe communication & coordination<\/td>\n Asynchronous buffering, pipelines<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n5. What is the difference between concurrency and parallelism?<\/h2>\n
Concurrency<\/h3>\n
Parallelism<\/h3>\n
\n6. What is GOMAXPROCS?<\/h2>\n
GOMAXPROCS<\/code> sets the maximum number of OS threads executing Go code simultaneously.<\/p>\nruntime<\/span>.<\/span>GOMAXPROCS(4<\/span>)<\/code><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n7. What are pointers in Go?<\/h2>\n
x<\/span> :=<\/span> 10<\/span><\/code><\/div>\n<\/div>\n<\/div>\np<\/span> :=<\/span> &<\/span>x<\/span>\r\n\r\nfmt<\/span>.<\/span>Println(*<\/span>p<\/span>)<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n
\n8. What is the difference between
new()<\/code> and make()<\/code>?<\/span><\/h2>\nnew()<\/code><\/span><\/h3>\np<\/span> :=<\/span> new<\/span>(int<\/span>)<\/code><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nmake()<\/code><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\nm<\/span> :=<\/span> make(map<\/span>[string<\/span>]