In this session, we will go over the LISt Processing Language (LISP), a programming language developed in the mid-1950s based solely on the concept of using lists to write and execute code! Although seemingly inapplicable to our modern world, LISP remains a very powerful language and presents a very different approach to programming than the traditional/algorithmic languages like Python, C++, and Java. This course is introductory-level, so there are no pre-requisites (except a desire to learn and have fun!). We will be going over the basics of LISP, and we might go through writing some basic code on an online compiler, as well as some real world applications if time permits. This course is also helpful for the Contest #2 (and finals) of the American Computer Science League (ACSL) Senior division competition, although the main goal of this session is to learn and have as much fun as possible in 75 minutes!

We will be going over the Binary Search Tree (BST) data structure, and will be learning its applications, including the use of Binary Search to efficiently and effectively find elements. If we have time, we will also go over Stacks and Queues--which although are a different topic, they are still very useful in graph algorithms. Prerequisites: It is very helpful to have a good understanding of numbers. Other than that, make sure to come ready to learn something new!

We will be covering Sorting and Searching Algorithms! Sorting and searching through arrays are the building blocks for countless datastructures and algorithms in Computer Science. From sets to hashmaps to trees and graphs, the uses are limitless! This is an introductory-level course, where we will be covering various algorithms for finding elements within an array of elements, and sorting arrays of elements. The main purpose of such algorithms are speed and efficiency, and we will cover a few algorithms that are faster in some areas than others. Note: We will not necessarily be implementing these algorithms into any programming languages. However, if we have time or there arises any questions regarding implementation, I will be more than happy to help with any code! Prerequisites: None, although a good logical background would definitely help! The next time someone asks you to guess their number from a range of 2000 numbers, impress them in only less than 11 moves!

Learn about the fundamental boolean (true/false) operators, and their relations with each other, forming the basics of logic operators through what is known as boolean algebra! In this one hour mini-lesson, you will learn logic operators like OR, AND, NOT, and more, and learn how to apply them to solve boolean expressions! Without even knowing it, everyone uses boolean algebra in their daily lives, whether it be searching up Jaguar cars AND NOT the animal "Jaguar," or talking about how you like the move Cars 1 but NOT Cars 2. Pre-requisites: Although there are no real requisites for this lesson, please have a good amount of knowledge in algebra, and make sure to be ready to have fun learning!

In this session, we will explore several different bases/number systems that are used in computers and other parts of computer science! Some bases that we will cover include, but are not limited to: - Binary (Base 2) - Octal (Base 8) - Hexadecimal (Base 16) We will learn how to convert a number from decimal (base 10, what we usually use in our everyday lives) to any different base, convert from a number in a different base to decimal, and convert a number from a different base to another (non-decimal) base! Pre-requisites: There are no pre-requisites, except for knowledge of the basic operations (multiplication, addition, etc.), and the desire to learn new things!

In just one hour, get ready to learn all about recursive functions, also known as piecewise functions! By the end of the session, you will have all the fundamental knowledge necessary to solve recursion-related problems! Pre-requisite: Please be comfortable with equations, variables, and the basics of functions. It is totally alright if you are not very familiar with functions, feel free to ask any additional questions during class. Additionally, you can check out the functions chapter from Khan Academy's Algebra 1 course.

We will be going over three main data structures that are essential in many algorithms: - Stacks (Recursion-based) - Queues (Useful in BFS) - Binary Search Trees (Fast search algorithms) This session does not involve any programming, so no programming experience is required, and we will be learning these algorithms from scratch, so don't worry if you haven't heard of these data structures before!

Learn the fundamental concepts in computer engineering, from computer number systems to digital electronics! We will cover topics like prefix/postfix/infix notation, boolean algebra (a combination of logic and algebra), and the basics of graph traversals and adjacency matrices. This course will follow American Computer Science League (ACSL) materials, and will help prepare you for the contests. It will equip you with the necessary knowledge to start your computer engineering journey, even if you don't plan on taking the contests! Please note that this course is meant to teach you the core concepts in computer engineering, which will be helpful for both engineering and computer science. These topics are useful in programming, but as we will not be covering programming tasks, no programming experience is required.