Get an overview of ACSL Senior, the contest schedule, and all the resources you can tap into. We’ll set up smart study habits and time-management tricks so you start strong and stay on track.

Dive into binary, octal, decimal, and hexadecimal, then see how recursion solves big problems by breaking them into bite-sized steps. Hands-on examples make the math and code click.

Train your detective skills by figuring out what short code snippets actually do, then write your own programs to reinforce every Contest 1 concept.

Master prefix, infix, and postfix notation for fast expression evaluation, then harness AND, OR, XOR, and NOT to manipulate bits like a pro.

Explore LISP’s parentheses-powered world and tackle programming challenges that blend notation skills with bit-level thinking.

Simplify complex logic with Boolean algebra, then build and use stacks, queues, and binary search trees to organize data efficiently.

Learn how finite state automata and regular expressions spot patterns, then code solutions that use these ideas for Contest 3 problems.

Map relationships with graph theory and peek inside computers with digital electronics basics—gates, flip-flops, and more.

Write low-level code in assembly, sharpen your debugging radar, and solve programming tasks that tie together all Contest 4 topics.

Recap every major idea, run through quick-fire drills, and polish your contest tactics so you enter each ACSL round confident and prepared.