In this beginner-friendly Python session, we’ll break down programming into simple, fun, and practical steps. You’ll learn by doing—writing real code as we explore variables, loops, functions, logic, and more through interactive demos and easy challenges. No experience needed! By the end, you’ll understand the foundations of Python and feel confident building your own small programs. Come curious, leave empowered! 🚀🐍

I'll be going over Binary conversions + hexadecimal and cover AP practice questions with these topics.

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!

Winter break is the perfect opportunity to fill gaps in your knowledge, make sure you're all set going into the new semester, and ready up for the AP Exam in May. If you want to make the most of your time off, this series is the place for you!