Learn

12 topics across 4 contests. Read the lesson, then test yourself with a quiz.

Contest 1

Computer Number Systems
Binary, octal, hex conversions and arithmetic in different bases.
Recursive Functions
Tracing and evaluating functions that call themselves.
WDTPD - Branching
Reading code with if/else logic and predicting the output.

Contest 2

Prefix/Infix/Postfix Notation
Converting and evaluating expressions in prefix, infix, and postfix form.
Bit-String Flicking
Bitwise operations (AND, OR, XOR, NOT, SHIFT) on binary strings.
WDTPD - Looping
Tracing for/while loops and determining what gets printed.

Contest 3

Boolean Algebra
Simplifying and evaluating boolean expressions with logic laws.
Data Structures
Stacks, queues, binary trees, and priority queues.
WDTPD - Arrays
Tracing code that reads, writes, and searches arrays.

Contest 4

Graph Theory
Paths, cycles, trees, and matrix representations of graphs.
Digital Electronics
Logic gates, truth tables, and circuit simplification.
WDTPD - Strings
Tracing code that manipulates and searches strings.