Award-Winning Computer Science Tutors
serving Bremerton, 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.

Allison's CS degree from Dartmouth means she's worked through the full arc — from writing first programs to tackling data structures, algorithms, and computational theory. She unpacks abstract concepts like recursion and Big-O analysis by walking through concrete code examples, making the logic visible before the notation takes over.

Elizabeth's computer science degree and professional software development career mean she teaches CS concepts the way they're actually used — not just as textbook definitions. Whether it's understanding recursion, tracing through data structures, or reasoning about algorithmic efficiency, she connects abstract ideas to real code she's written on the job.

I am a undergraduate freshman of the University of Michigan, studying business at the Ross School of Business. Working together with students and having a good time while seeing steady improvements has proven to provide me great joy. I believe that communication and relationship building is crucial for students to open up about their struggles and also for me to identify problems they don't realize they can improve on, so this is a key aspect of all of my lessons. During my free time, I enjoy playing sports or snacking on desserts while binge-watching Friends!

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.

Between his coursework at Rice and his background in algorithms, Daniel tackles computer science from both the practical and theoretical sides — writing clean code and understanding why one sorting algorithm outperforms another for a given dataset. He's especially strong at breaking down recursion, data structures, and algorithmic complexity into steps that build logically on each other.

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.

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.

From data structures and algorithm analysis to the fundamentals of how operating systems and networks function, Nicholas covers computer science with the depth his Penn State CS degree provided. He's especially strong at explaining recursion, sorting algorithms, and Big-O notation — the concepts that separate students who can code from students who truly understand computation. Rated 5.0 by students.

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.

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 computer architecture and theory to parallel computing and machine learning, Brandon's master's coursework at RIT covers the full stack of computer science concepts. His two years of professional industry experience mean he can connect abstract topics — algorithm complexity, concurrency models, data structures — to how they actually show up in production code. Students rated him 4.9, which tracks with his ability to make dense CS material feel approachable.

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.