Enroll now and take 20% off your spring course using coupon KTSPRING25

ACSL Elementary

[ACSL ELEM]

Full Course

$1000 USD
Before any discounts or coupons
for 25 hours

Class Description:

The American Computer Science League (ACSL) is the longest running computer science contest in the United States since 1978. Since 2020 the contest has been open to people online around the world. This prep course will allow students to review material, receive live instructions practicing past contests, and participate together as a team through KTBYTE.

Prerequisites:

Elementary Division: Age 8-12, Grades 3-6

Syllabus:

Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)

We cover how to convert from decimal to other number systems (binary, octal, and hexadecimal) and back to decimal.

Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)

We discuss how colors are represented in computers through hex codes. We learn faster tricks to convert from binary to octal and hexadecimal and from octal and hexadecimal back to binary.

Computer Number Systems (Binary, Octal, Decimal, Hexadecimal)

We review conversions between different bases and learn how to add and subtract numbers in different number systems.

Contest 1 Review / Working through Higher level problems

We review the concepts for this contest, including conversions between different bases, color codes, and arithmetic operations. We go over sample contest problems on number systems from upper divisions.

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