ACSL Intermediate/ Senior Study Materials
[ACSL ADVANCED CONTENT]
Full Course
Class Description:
Want to support your child as they prepare for this year's American Computer Science League (ACSL) contests? We offer the teaching materials used by our instructors for students who prefer to prepare on their own. Note that students enrolled in a prep course do not need to sign up for these study materials. Students will gain access to our Advanced Prep Course classpage with study materials and solutions, presented with a timeline for how best to prepare for each contest. Study materials are not eligible for refunds.
Class Description::
Want to support your child as they prepare for this year's American Computer Science League (ACSL) contests? We offer the teaching materials used by our instructors for students who prefer to prepare on their own. Note that students enrolled in a prep course do not need to sign up for these study materials. Students will gain access to our Advanced Prep Course classpage with study materials and solutions, presented with a timeline for how best to prepare for each contest. Study materials are not eligible for refunds.
Prerequisites:
Registered on the KTBYTE Intermediate or Senior ACSL team
Prerequisites:
Registered on the KTBYTE Intermediate or Senior ACSL team
Related Classes
Related Classes
Syllabus:
Computer Number Systems - Pseudocode Tracing - Recursive Functions
This class focused on computer number systems, recursive functions and pseudocode tracing.
Pre/Post/Infix Notation, Bit-String Flicking, and LISP
Today we'll be doing some Pre/Post/Infix Notation, Bit-String Flicking, and LISP and doing problems from the attached short answer problems.
Reviewing Pre/Post/Infix Notation, Bit-String Flicking, and LISP
Today we'll be reviewing Pre/Post/Infix Notation, Bit-String Flicking, and LISP.
Pre/Post/Infix Notation, Bit-String Flicking, LISP, and coding problems
Today we'll be reviewing Pre/Post/Infix Notation, Bit-String Flicking, and LISP.We also will be workign on some Coding problems.
Pre/Post/Infix Notation, Bit-String Flicking, LISP, and coding problems
Today we'll be reviewing Pre/Post/Infix Notation, Bit-String Flicking, LISP, and coding problems and doing problems from the attached problems.
"Today we'll be reviewing Pre/Post/Infix Notation, Bit-String Flicking, LISP, and coding problems and doing problems from the attached problems.\n"
blank
Boolean Algebra, Data Structures, Regular Expressions
Today we'll be reviewing Boolean Algebra, Data Structures, and Regular Expressions and doing problems from the attached problems
Boolean Algebra, Data Structures, Regular Expressions
Reviewing Boolean Algebra, Data Structures, and Regular Expressions and doing problems from the attached problems
Syllabus
Computer Number Systems - Pseudocode Tracing - Recursive Functions
This class focused on computer number systems, recursive functions and pseudocode tracing.
Pre/Post/Infix Notation, Bit-String Flicking, and LISP
Today we'll be doing some Pre/Post/Infix Notation, Bit-String Flicking, and LISP and doing problems from the attached short answer problems.
Reviewing Pre/Post/Infix Notation, Bit-String Flicking, and LISP
Today we'll be reviewing Pre/Post/Infix Notation, Bit-String Flicking, and LISP.
Pre/Post/Infix Notation, Bit-String Flicking, LISP, and coding problems
Today we'll be reviewing Pre/Post/Infix Notation, Bit-String Flicking, and LISP.We also will be workign on some Coding problems.
Pre/Post/Infix Notation, Bit-String Flicking, LISP, and coding problems
Today we'll be reviewing Pre/Post/Infix Notation, Bit-String Flicking, LISP, and coding problems and doing problems from the attached problems.
"Today we'll be reviewing Pre/Post/Infix Notation, Bit-String Flicking, LISP, and coding problems and doing problems from the attached problems.\n"
blank
Boolean Algebra, Data Structures, Regular Expressions
Today we'll be reviewing Boolean Algebra, Data Structures, and Regular Expressions and doing problems from the attached problems
Boolean Algebra, Data Structures, Regular Expressions
Reviewing Boolean Algebra, Data Structures, and Regular Expressions and doing problems from the attached problems