ACSL Intermediate And Senior

This class focused on computer number systems.

This class focused on recursive functions.

Today we learned about analyzing and solving problems involving pseudo code!

Today, we reviewed for the shorts portion of Contest 1 by completing miscellaneous problems that have shown up on past contests.

Today we practiced solving programming problems from past years' first contests.

Today we continued practicing solving programming problems from past years' first contests.

Today we learned how to solve problems involving prefix, infix, and postfix notation. This type of question appears in problems 1-2 of contest 2.

Today we learned about Bit-String Flicking, a concept that involves some boolean algebra along with other logical operators with 0s and 1s. The notation takes some getting used to, but once you understand it, you'll be able to solve some very interesting ACSL problems!

Today we learned about LISP, one of the first functional languages invented in 1958. It is infamous for having lots of parentheses, so much so that we often joke that LISP stands for “Lots of Irritating Silly Parentheses.”

Today we learned about LISP, one of the first functional languages invented in 1958. It is infamous for having lots of parentheses, so much so that we often joke that LISP stands for “Lots of Irritating Silly Parentheses.”

Today we practiced solving programming problems from past years' second contests.

Today, we reviewed for the shorts portion of Contest 2 by completing miscellaneous problems that have shown up on past contests.

Today, we continued reviewing for the shorts portion of Contest 2 by completing miscellaneous problems that have shown up on past contests.

We learned about solving problems involving the first Contest 3 topic, Boolean algebra.

We learned about solving problems involving the second Contest 3 topic, Data structures. These include queues, stacks, and binary search trees.

Today, we talked about Regular Expressions, which are a way we can represent patterns of Strings. Finite State Automatons (FSAs) model these as a sequence of states and transitions.

Today we practiced solving programming problems from past years' third contests.

Today, we reviewed for the shorts portion of Contest 3 by completing miscellaneous problems that have shown up on past contests.

Today, we continued reviewing for the shorts portion of Contest 3 by completing miscellaneous problems that have shown up on past contests.

We explored Graph Theory, which involves a mathematical concept called matrix multiplication.

Today, we learned about solving problems involving the second Contest 4 topic, Digital Electronics. This topic is an extension of Boolean Algebra. In fact, it’s simply a visual representation of Boolean algebra expressions using circuits, so bring all your Contest 3 Boolean algebra knowledge to the lesson!

Today we learned about analyzing and solving problems involving ACSL's Assembly programming language.

Today, we reviewed for the shorts portion of Contest 4 by completing miscellaneous problems that have shown up on past contests.

Today, we reviewed for the shorts portion of ACSL Senior and Intermediate Finals by completing miscellaneous problems that have shown up on past contests. We also discussed some trickier application of previous concepts already taught.

Today, we reviewed for the shorts portion of ACSL Senior and Intermediate Finals by completing miscellaneous problems that have shown up on past contests. We also discussed some trickier application of previous concepts already taught.

Today, we reviewed for the shorts portion of ACSL Senior and Intermediate Finals by completing miscellaneous problems that have shown up on past contests.

Today, we reviewed for the shorts portion of ACSL Senior/Intermediate Finals by completing miscellaneous problems that have shown up on past contests. We also practiced solving programming problems from past years' all-star contests.