Free Go Concurrency Learning Path
The worker station

GOAL
Create a bounded Go worker-pool example that processes four jobs and collects every result without depending on completion order.

START
Read workbook.html, inspect case-data.csv, complete the five stage outputs, then the capstone. Use evidence-log.csv to record only actions actually performed.

CASE
Four synthetic jobs contain values 2, 3, 4 and 5. Two workers square each value. Completion order is unspecified; the final report sorts by job ID. Each submitted job must produce exactly one result.

TOOLS
Basic programming and a local Go toolchain for execution. No remote jobs or network calls are used.

LOCAL COMMANDS / OPENING
go test; go test -race; go run . (separate commands; requires Go)

ASSESSMENT
Score at least 80/100, supply every required artifact, and satisfy the path-specific critical condition. Rework missing evidence before marking complete.
Critical condition: No worker closes the shared results channel prematurely and every job ID has exactly one result.

SOURCE COURSES
Free Simplilearn Course: Go Programming, Concurrency and Interfaces — https://wikifree.com/courses/free-simplilearn-go-programming-concurrency-and-interfaces/

RIGHTS AND SCOPE
Original WikiFree teaching case and exercises. All case data are synthetic. Provider lessons are linked, not redistributed. No certificate, real project delivery or unperformed runtime test is claimed.
