v0.40: Create exercises. Challenge the community.

YU

Learn C

yuuuri01's path

View graph

68%

Structure your code

You compile, you print, and you read what the compiler tells you.

2 / 5 complete5 modules

First programCompleteThe edit, compile, read the verdict loop.1 to 2

Read the errorCompleteReading a compiler diagnostic and fixing the line it points at.

Structure your code

You split a problem into functions and reach values through pointers.

1 / 4 complete

Text

You read, write and transform text without ever leaving the buffer.

6 / 6 complete

Memory

You own every allocation you make, and you can prove there is no leak.

Your own types

You model data with your own types and hide them behind an interface.

2 / 5 complete

The machine

You reason about bits, cost and files the way the machine does.

1 / 4 complete

The system

You make processes talk to each other without ever blocking.

0 / 1 complete

1 to 2

Types and valuesIn progressInteger types, implicit conversions, promotions and overflow.2 to 3

Conditions and loopsIn progressBranching and the three loop forms, chosen on purpose.2 to 3

Command lineIn progressReading `argc` and `argv`, and reporting a bad invocation.2 to 3

4 modules

FunctionsCompleteDeclaration, definition, and the contract a function honours.2 to 4

RecursionIn progressBase case, recursive case, and the call stack underneath.2 to 3

PointersIn progressAddress, dereference, output parameter, and the half-open range.2 to 4

Arrays and matricesIn progressOne and two dimensional arrays, row-major order, and array decay.2 to 4

6 modules

Characters and ASCIICompleteThe byte as a value, the ASCII table, and the classification predicates.2 to 2

Strings: walking and searchingCompleteA string is an array of bytes plus its terminator, and nothing more.2 to 4

Writing text without overflowingCompleteCapacity, termination, and the truncation you have to decide on.3 to 4

Words and tokensCompleteWord boundaries, tokenising, and normalising whitespace.3 to 4

Transforming textCompleteCharacter to character mapping, in place against out of place.3 to 4

Numbers and basesCompleteText to number and back, in any base, without wrapping around.3 to 5

1 / 3 complete

3 modules

Dynamic memoryIn progressAllocating, growing and releasing memory, and who owns what.3 to 5

Bytes and raw memoryCompleteThe untyped byte, `void *`, and regions that overlap.3 to 4

Memory safetyBounds, use after free, double free, and reading a leak report.2 to 3

5 modules

Structs, unions, enumsGrouping fields into a record, and what the compiler does with it.2 to 3

Headers and the preprocessorSplitting a program across files, and what the preprocessor pastes.2 to 4

Linked listsCompleteRe-linking nodes, and walking a chain you cannot index.3 to 4

Stacks, queues, treesCompleteAn abstract data type is an interface plus an invariant.4 to 5

Generic codeIn progressFunction pointers, comparators, and a pointer plus a size.4 to 5

4 modules

Bits and representationCompleteBitwise operators, masks, shifts, and how a value is laid out.2 to 4

Sorting and searchingIn progressLoop invariants, halving a range, and what an algorithm costs.2 to 4

Files and streamsIn progressReading and writing a stream without loading all of it at once.3 to 5

Parsing and formatsIn progressTokenising, state machines, and recursive descent.4 to 5

1 module

Processes and signalsIn progressSpawning processes, wiring them together, and staying responsive.5 to 5