Computer Number Systems
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.
Recursive Functions
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.
Contest 1 Programming
Today we practiced solving programming problems from past years' first contests.
Contest 2- Prefix, Infix, Postfix Notation
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.
Contest 2- Bit String Flicking
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!
Contest 2- What Does This Program Do? - Looping
Today we learned about analyzing and solving problems involving pseudo code, a concept that branches off Topic 3 from Contest 1, by adding looping!