Schoolhouse.world: peer tutoring, for free.
Free SAT® Prep, as part of a research study.
SAT® Bootcamps
Free SAT® Prep, as part of a research study.
Get free help applying to college.
College Admissions Workshops
Get free help applying to college.
1-on-1 conversations on global topics
Dialogues
1-on-1 conversations on global topics
A global network of volunteers.
Explore Tutors
A global network of volunteers.

Join this subworld to ask questions, participate in discussions, and attend sessions.

Want to host your own sessions?

Become a tutor to lead sessions, give back, and build community.

Starting Soon

Computer Science Series

3

Turkish Olympiad: C problem solving

11th session

This series is all about tackling C problem solving for the first stage of the TÜBİTAK Science Olympiad (Turkish Olympiad). We’ll dive into past year papers, currently focusing on the 32nd TÜBİTAK Olympiad.

This series is for İrem İ, though anyone interested can join in!

This series will go over 75 Turkish Olympiad C problems. Expect to get homework like look up Recursion. I will try to have materials for such things prepared ahead of time.

THIS REQUIRES KNOWLEDGE OF C PROGRAMMING.

So, if you know C++ your good mostly. If you know Java or C# but not C++ or C, I will need to interview you to see if your a good fit. Plays with pointers for an example.

Nishtha S

Registration full.

IGCSE CIE Computer Science Full Walkthrough

11th session

Full walkthrough of all the chapters in both papers of the IGCSE CIE computer science course (0478). We will be doing a chapter each lesson.

Advik B

4 spots left!

Data Structures & Algorithms: The Foundation of Problem Solving

13th session

Welcome to a series designed to demystify Data Structures and Algorithms (DSA). Whether you're a beginner preparing for your first coding interview, a student looking to ace your computer science classes, or simply curious about how to write more efficient code, this series is for you.

We will start with the fundamental building blocks and progress to more complex concepts. Through a mix of clear explanations, live coding demonstrations, and interactive problem-solving, we'll cover essential topics such as:

* Arrays, Linked Lists, Stacks, and Queues

* Trees, Heaps, and Graphs

* Sorting and Searching Algorithms

* Time and Space Complexity Analysis (O(n) notation)

Note: We'll be covering DSA in C++

Our goal is not just to teach you the theory, but to build your confidence in applying these concepts to solve real-world problems. No prior experience with DSA is required, just a willingness to learn and grow!

Also do let me know, if there's any issues with the timings.

Mohit S

10/20