Studying computer science at MIT, Brice digs into everything from data structures and algorithms to systems-level thinking with students at any stage. He's tutored over 30 students in the past year alone, tackling topics like recursion, object-oriented design, and algorithmic complexity. Rated 4.9 by students.

Learning to code is really learning to decompose problems — figuring out what a program needs to do before writing a single line. Nat is double-majoring in computer science at Vanderbilt and unpacks core topics like loops, conditionals, data structures, and algorithm design in ways that build genuine understanding. Whether a student is writing their first Python script or debugging recursive functions, he connects each concept to the logic behind it.

Ritesh's applied physics program at Cornell involves significant programming, from numerical simulations to data analysis, giving him hands-on fluency with core computer science concepts like algorithm design, data structures, and debugging logic. He unpacks topics such as recursion, sorting algorithms, and object-oriented principles by tying them to concrete problems rather than abstract definitions.

A Stanford MS in Computer Science means David can teach everything from data structures and algorithms to object-oriented design with the depth that comes from building real systems — not just reading about them. He spent a summer teaching web and app development to high school students in Palestine, so he knows how to make abstract CS concepts click through hands-on projects.

Studying both chemical engineering and computer science at Cornell gives Jonathan an unusual angle on programming — he's constantly writing code to solve quantitative, real-world problems rather than just completing standalone assignments. That dual perspective makes him especially effective at teaching algorithmic thinking and Java or Python fundamentals, since he can show students how CS concepts like iteration and data manipulation actually get applied in technical fields outside of software development.

Corrina's mechanical engineering degree required extensive programming coursework, and she now teaches core computer science concepts — data structures, algorithms, Boolean logic, and computational thinking — in a way that makes abstract ideas tangible. She connects each concept to real applications, whether that's sorting algorithms in a search engine or conditionals inside a robot's control loop.

Holding both a B.S. in Computer Science from the University of Kentucky and a game development master's in progress at SCAD, Evan covers the full stack of CS fundamentals: data structures, algorithm analysis, object-oriented design, and software architecture. He connects abstract concepts like Big-O complexity or recursion to concrete implementations in C, C++, and Java so the theory actually sticks.

Between his AP Computer Science 5 and his engineering coursework at Vanderbilt, William has written code across contexts — from introductory Java to computational modeling in his chemical engineering classes. He breaks down abstract concepts like recursion, data structures, and algorithm efficiency by walking through concrete examples line by line. Students who can follow the logic but freeze when writing code from a blank screen tend to gain traction quickly with his approach.

I am graduated from Penn State University in Industrial Engineering in 2017. I've tutored ever since I was in high school, and I love helping people! I like to help my students understand math (and other topics) instead of just doing it blindly. My goal is to help my students improve their math (and other topics) and build skills that will help them find learning easier in the future! Fun fact, I used to work for Disney and I like to salsa dance!

Most CS tutors come from pure software backgrounds — Clive's path runs through economics at Brown, where he picked up Java, Python, JavaScript, SQL, and HTML as tools for data analysis and building real projects rather than just completing problem sets. That applied angle makes him especially effective at teaching programming fundamentals and web technologies to students who learn better when code solves a tangible problem.

Studying computer science at Cornell's College of Engineering, Ravnoor digs into topics like data structures, algorithms, and object-oriented design on a daily basis. He breaks complex problems — recursion, linked lists, sorting efficiency — into smaller, concrete steps so students build genuine understanding they can apply to new challenges independently.

Michael earned his B.S. in Computer Science from UCLA, where he dug into everything from data structures and algorithms to software design principles. He breaks down abstract concepts like recursion, Big-O analysis, and object-oriented programming into concrete, step-by-step logic that clicks. He also teaches JavaScript, giving him a practical edge when students need to connect theory to actual code.