The ACSL is the longest running computer science contest in the United States since 1978. Since 2020 the contest is open to people online worldwide through KTBYTE. This club will allow students to review material, receive live instructions practicing historical contests, and participate together as a team in KTBYTE.
Clubs are run by qualified, award-winning KTBYTE Teaching Assistants.
The ACSL is the longest running computer science contest in the United States since 1978. Since 2020 the contest is open to people online worldwide through KTBYTE. This club will allow students to review material, receive live instructions practicing historical contests, and participate together as a team in KTBYTE.
Clubs are run by qualified, award-winning KTBYTE Teaching Assistants.
Elementary Age 8-12, Grades 3-6
Elementary Age 8-12, Grades 3-6
Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)
We covered how to convert from decimal to binary and binary to decimal. We also covered conversion from binary to octal and hex and back.
Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)
Great! We finished VOL41, 2018-2019 Contest 1 ; and we started VOL42, 2019-2020 Contest 1: Students completed Problem 1 in-class, and problems 2-5 are left for homework.Time permitting, we will also work on the 2019-2020, VOL 42 contest problems, which are: 1. What is the base 10 equivalent for 1357_8? 2. Which of the following is the largest number? 657_8, 1AD_16, 430_10 ? 3. Evaluate 3275_8 + 4653_8 - 657_8 . Express the answer in octal. 4. How many binary numbers have more 1's than 0's in the range of numbers from 16 to 31 in base 10 inclusive? 5. What is the sum of the decimal values of the red and the blue components for a color that is represented by the hexadecimal number A85F1C_16 ?
Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)
We will be covering the solutions to the homework from last time (VOL42 2019-2020 Elementary Contest 1 Problems 2-5). We covered all of 2019-2020 and completed 2016-2017 contest problems 1 and 2 in club. For homework, do problems 3-5. 1. Which of the following is the largest number? 657_8, 1AD_16, 430_10 ? 2. Evaluate 3275_8 + 4653_8 - 657_8 . Express the answer in octal. 3. How many binary numbers have more 1's than 0's in the range of numbers from 16 to 31 in base 10 inclusive? 4. What is the sum of the decimal values of the red and the blue components for a color that is represented by the hexadecimal number A85F1C_16 ? .
Contest 1 Review / Working through Higher level problems
For this week, we will actually be doing some Junior Division problems! From the 2013-2014 and 2014-2015 contests. Back then, there was no Elementary division, but I think a lot of our students can now handle these problems from a higher division.
Contest 1 In-Class
Students can choose to take Contest 1 during today's lesson.
Prefix, Infix and Postfix Notation
We introduced Contest 2 concepts relating to prefix/infix/postfix notation. For this class, I will begin by reminding students of PEMDAS/order of operations, and then I will transition into converting from infix to prefix, infix to postfix, etc. Near the end of class, I will review 2017-2018 elementary Contest 2 problems with students, with any unfinished work being assigned for homework.
Prefix, Infix and Postfix Notation
Finished reviewing the two contests’ worth of material that I’ve distributed so far. Afterwards, we’ll try a couple practice problems, and then finally I will talk about WHY prefix/ postfix notations are more advantageous for machines to use
Prefix/Postfix/Infix Notation
Today I will begin by reviewing how computers process prefix/postfix notation. Afterwards, we will go over the solutions to last week’s HW, and then we will look at contest 2 problems from last year
Prefix/Postfix/Infix Notation
Today will be the last class that we will be using to focus on Contest 2. I plan to allocate the first 30 minutes to a practice test, the next 15 minutes for reviewing the solutions to the practice test, and the last 15 minutes for introducing boolean algebra. If your child has already taken Contest 2, then I will have them read an article about boolean algebra. During the first 30 minutes of class, anyone reading this article will be able to send me any questions they have through the chat feature in GoToMeeting. By the end of the week, I would like everyone to have taken Contest 2 on HackerRank, though you technically have until March 7th to complete it.
Contest 2 In-Class
Students can choose to take Contest 2 during today's lesson. Anyone who prefers to take Contest 2 on their own time does not need to attend this session
Boolean Algebra
During this lesson we'll cover truth tables as well as not, and, and or operations. After today, students should feel comfortable answering the first three questions of any given Contest 3 practice test.
Boolean Algebra
Hope you are enjoying the beautiful weather outside! Today, I plan on teaching simplification techniques and tautologies.
Boolean Algebra
Today I will begin by reviewing the HW from last week. Then, I will quickly review simplification techniques as well as equality. Afterwards, students should know all material necessary to score a 5 on contest 3. Time permitting, we'll also have a competition where the top three highest scoring students will receive a shoutout in this chat :D
Boolean Algebra
Hi everyone! Today we'll begin by reviewing any questions that students might have. Afterwards, we'll have another competition with a set of new contest 3 questions!
Contest 3 In-Class
Students can choose to take Contest 3 during today's lesson. Anyone who prefers to take Contest 3 on their own time does not need to attend this session
Graph Theory
Today we begint to explor Graph Theory, which involves identifying some special kinds of graphs and calculating cycles and paths by hand.
Graph Theory
Contest 4 In-Class
Students can choose to take Contest 4 during today's lesson. Anyone who prefers to take Contest 3 on their own time does not need to attend this session
All Star Review
Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)
We covered how to convert from decimal to binary and binary to decimal. We also covered conversion from binary to octal and hex and back.
Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)
Great! We finished VOL41, 2018-2019 Contest 1 ; and we started VOL42, 2019-2020 Contest 1: Students completed Problem 1 in-class, and problems 2-5 are left for homework.Time permitting, we will also work on the 2019-2020, VOL 42 contest problems, which are: 1. What is the base 10 equivalent for 1357_8? 2. Which of the following is the largest number? 657_8, 1AD_16, 430_10 ? 3. Evaluate 3275_8 + 4653_8 - 657_8 . Express the answer in octal. 4. How many binary numbers have more 1's than 0's in the range of numbers from 16 to 31 in base 10 inclusive? 5. What is the sum of the decimal values of the red and the blue components for a color that is represented by the hexadecimal number A85F1C_16 ?
Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)
We will be covering the solutions to the homework from last time (VOL42 2019-2020 Elementary Contest 1 Problems 2-5). We covered all of 2019-2020 and completed 2016-2017 contest problems 1 and 2 in club. For homework, do problems 3-5. 1. Which of the following is the largest number? 657_8, 1AD_16, 430_10 ? 2. Evaluate 3275_8 + 4653_8 - 657_8 . Express the answer in octal. 3. How many binary numbers have more 1's than 0's in the range of numbers from 16 to 31 in base 10 inclusive? 4. What is the sum of the decimal values of the red and the blue components for a color that is represented by the hexadecimal number A85F1C_16 ? .
Contest 1 Review / Working through Higher level problems
For this week, we will actually be doing some Junior Division problems! From the 2013-2014 and 2014-2015 contests. Back then, there was no Elementary division, but I think a lot of our students can now handle these problems from a higher division.
Contest 1 In-Class
Students can choose to take Contest 1 during today's lesson.
Prefix, Infix and Postfix Notation
We introduced Contest 2 concepts relating to prefix/infix/postfix notation. For this class, I will begin by reminding students of PEMDAS/order of operations, and then I will transition into converting from infix to prefix, infix to postfix, etc. Near the end of class, I will review 2017-2018 elementary Contest 2 problems with students, with any unfinished work being assigned for homework.
Prefix, Infix and Postfix Notation
Finished reviewing the two contests’ worth of material that I’ve distributed so far. Afterwards, we’ll try a couple practice problems, and then finally I will talk about WHY prefix/ postfix notations are more advantageous for machines to use
Prefix/Postfix/Infix Notation
Today I will begin by reviewing how computers process prefix/postfix notation. Afterwards, we will go over the solutions to last week’s HW, and then we will look at contest 2 problems from last year
Prefix/Postfix/Infix Notation
Today will be the last class that we will be using to focus on Contest 2. I plan to allocate the first 30 minutes to a practice test, the next 15 minutes for reviewing the solutions to the practice test, and the last 15 minutes for introducing boolean algebra. If your child has already taken Contest 2, then I will have them read an article about boolean algebra. During the first 30 minutes of class, anyone reading this article will be able to send me any questions they have through the chat feature in GoToMeeting. By the end of the week, I would like everyone to have taken Contest 2 on HackerRank, though you technically have until March 7th to complete it.
Contest 2 In-Class
Students can choose to take Contest 2 during today's lesson. Anyone who prefers to take Contest 2 on their own time does not need to attend this session
Boolean Algebra
During this lesson we'll cover truth tables as well as not, and, and or operations. After today, students should feel comfortable answering the first three questions of any given Contest 3 practice test.
Boolean Algebra
Hope you are enjoying the beautiful weather outside! Today, I plan on teaching simplification techniques and tautologies.
Boolean Algebra
Today I will begin by reviewing the HW from last week. Then, I will quickly review simplification techniques as well as equality. Afterwards, students should know all material necessary to score a 5 on contest 3. Time permitting, we'll also have a competition where the top three highest scoring students will receive a shoutout in this chat :D
Boolean Algebra
Hi everyone! Today we'll begin by reviewing any questions that students might have. Afterwards, we'll have another competition with a set of new contest 3 questions!
Contest 3 In-Class
Students can choose to take Contest 3 during today's lesson. Anyone who prefers to take Contest 3 on their own time does not need to attend this session
Graph Theory
Today we begint to explor Graph Theory, which involves identifying some special kinds of graphs and calculating cycles and paths by hand.
Graph Theory
Contest 4 In-Class
Students can choose to take Contest 4 during today's lesson. Anyone who prefers to take Contest 3 on their own time does not need to attend this session
All Star Review