ACSL Elementary Study Materials

Today we went over the contest format and practiced strategies for Computer Number Systems problems. The optional homework is to try problems 3 and 4 from the Short Answer Questions. If you'd like you can also try the Recursive Functions Problems (1-2), which we'll learn about next week.

Today we cover strategies for solving Recursive Function problems and the Branching problem. We start with the Recursive Functions problems (3-4) in the short answer test from 2018-2019.

Today we practiced 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 analyzing and solving problems involving pseudo code, a concept that branches off Topic 3 from Contest 1, by adding looping!

Today, we continued with the topic "What Does This Program Do - Looping" to explore some more tricky problems that have come up on previous contests.

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.

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, explored some rather tricky Array-Pseudocode problems that have come up on previous contests. As we've said in the past two contests with these types of problems, every problem has a trick to it! Today we will simply add another level of syntax to that idea.

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 explored some rather tricky String-Pseudocode problems that have come up on previous contests. As we've said in the past three contests with these types of problems, every problem has a trick to it! Today we will simply add yet another level of syntax to that idea.

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