Award-Winning Computer Science Tutors
serving Kennewick, WA

Applied mathematics at UCLA means Maria writes code constantly — from implementing numerical methods to building optimization algorithms for economics models. She brings that practical, problem-solving mindset to computer science topics like data structures, algorithm analysis, and debugging logic errors in real programs.

As a dedicated tutor with over 2 years of experience, I am passionate about fostering a supportive learning environment where students can thrive in subjects like Algebra, Business Analytics, and Data Science. Currently pursuing my Bachelor's in Informatics at the University of Washington, I incorporate real-world applications into my teaching to engage students and enhance their understanding of complex concepts. My approach emphasizes personalized learning, encouraging students to ask questions and develop critical thinking skills. I find great joy in witnessing my students' growth and success, and I strive to instill a love for learning that extends beyond the classroom.

Intensely curious, I am interested in STEM subjects and the liberal arts. I tutor to help you reach your educational goals and because it's immensely gratifying to see my students succeed.

Studying Computer Science at the University of Washington means Antonia is immersed in algorithms, data structures, and computational thinking every day. She unpacks topics like sorting algorithms, Big-O analysis, and abstraction by connecting them to practical problems students can visualize. Her dual-language tutoring background also makes her particularly skilled at explaining technical jargon in plain, accessible terms.

I'm a tutor who loves the moment when a concept finally clickswhether that's solving a calculus problem or debugging a first Python script. With experience teaching math from elementary to college level and professional training in full-stack development, I help students build confidence alongside competence in both math and programming. At Mathnasium, I worked with groups of 4-6 students at different levels, learning to adapt quickly to different learning styles. I bring that same flexibility to teaching HTML, CSS, JavaScript, Python, and other programming languages. I don't just give answersI guide students to discover solutions themselves because that's what sticks. Whether it's explaining why a for-loop isn't working, walking through derivatives, preparing for the SAT, or building a first web page, I focus on understanding over memorization. I'm patient but direct, and I adjust my approach based on what's actually working for each student. My goal is simple: make learning feel achievable, not intimidating, and give students tools they can use long after our sessions end.

Biomedical engineering at Rice requires heavy computational coursework, so Theresa has tackled core computer science concepts — from object-oriented programming and data structures to algorithm complexity — in the context of solving real problems. She explains abstract ideas like recursion and sorting algorithms by connecting them to concrete examples rather than letting students drown in theory. Rated 5.0 by students.

Julia is a computational science major at Stanford who writes code daily and understands the gap between knowing syntax and thinking like a programmer. She digs into core concepts like recursion, data structures, and algorithm design by walking through problems step by step until the logic becomes intuitive. Students learning Python, Java, or tackling their first real debugging challenge get someone who can explain the *why* behind every line.

Earning a certificate in Statistics and Machine Learning at Princeton gave Julie hands-on experience with core computer science concepts — algorithm design, data structures, and computational complexity. She approaches CS the way she approaches philosophy: by asking students to reason through *why* a solution works, not just whether it compiles.

Ryan is a computer science major at Cornell, which means he's actively working through the same core curriculum — algorithms, data structures, computational complexity — that college CS students encounter. He explains concepts like recursion, Big-O analysis, and graph traversal by tracing through concrete examples rather than relying on abstract definitions. Rated 4.8 across his sessions.

Studying computer science at Cornell, Eric tackles everything from algorithm analysis and Big-O notation to systems-level concepts like memory management and recursion. He breaks down problems the way a CS student actually encounters them — whiteboarding a solution, tracing through edge cases, then translating logic into clean code. His 5.0 rating speaks to how clearly that approach lands.

Philosophy trained Calin to build rigorous logical arguments; his math and CS degrees taught him to express that logic in C++ and JavaScript. That combination means he teaches programming concepts — from algorithm design to data structure selection — as exercises in precise reasoning, where every line of code follows from a clear chain of thought. Rated 5.0 by students.

From sorting algorithms and Big-O analysis to data structures like linked lists and binary trees, Rhamy covers the foundational CS concepts that show up in coursework and technical interviews alike. His computer engineering degree at Vanderbilt, paired with experience in multiple languages, lets him explain abstract ideas through concrete code. Rated 5.0 by students.

From sorting algorithms to recursion to object-oriented architecture, computer science rewards the ability to think in layers of abstraction. Joel is pursuing CS at Cornell alongside physics, which means he approaches programming problems with both mathematical rigor and practical debugging instincts. He's comfortable across Python and Java and adapts to whatever language a student's course requires.

Studying Computer Science alongside Math/Stats at Carleton College, Thomas lives at the intersection of algorithms, data structures, and mathematical reasoning. He digs into topics like recursion, sorting algorithms, and object-oriented design by building understanding from first principles rather than rote code memorization.

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.

Pursuing a CS master's at Penn while TAing discrete math means Keenan lives in both the theoretical and practical sides of computer science every day. He unpacks core topics like algorithm complexity, data structure tradeoffs, and computational logic in a way that connects abstract ideas to real code. Rated 5.0 across all sessions.

From data structures and algorithms to systems-level thinking, computer science covers enormous ground. John earned a BS in Computer Science and codes in Java, C++, and SQL, giving him the range to dig into whatever topic is causing trouble — whether that's recursion, Big-O analysis, or database design.