Award-Winning Computer Science Tutors
serving Reading, PA

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.

Studying computer science at the University of Pittsburgh while working as a software engineer gives Timothy a dual perspective — he knows the theory behind data structures and algorithms and also knows which concepts actually matter on the job. He breaks down topics like recursion, Big-O analysis, and object-oriented design by tying them to problems students can visualize and build.

Studying AI at Penn State gave Lucas a deep understanding of computer science from the ground up — data structures, algorithms, object-oriented design, and how they all connect in real applications. He's taught students brand-new to coding as well as those debugging complex projects, and he tailors each session to the language and concepts at hand. Rated 4.9 by students.

Whether a student is writing their first loop or debugging a recursive function, Kevin connects new programming concepts to the logic underneath them so the syntax stops feeling arbitrary. His data science concentration means he's comfortable across languages and paradigms, and his experience teaching first-time coders in underserved communities sharpened his ability to explain abstract ideas without jargon.

From sorting algorithms to data structures to the big-picture question of how computers actually process information, Steven covers computer science at both the high school and college level. He programs in Java and C#, which means he can explain concepts like recursion or object-oriented design in whichever language a student's course uses. Rated 5.0 by students across his subjects.

Jared's CS background spans both the theoretical and the applied — his master's in computer science covered areas like machine learning and NLP, while his professional work as a software engineer means he writes production code in Java, C++, and Python daily. That range lets him teach everything from foundational data structures and algorithms to more advanced topics like relational database design with the perspective of someone who's actually built systems around these concepts. Rated 5.0 by students.

I am a current sophomore at Cornell University pursuing a B.S. in Biomedical Engineering. I have done extensive coursework in biology, physics, chemistry, math, and lab sciences. I love applying engineering problem-solving skills to the biological sciences. For the past year, I have been a teaching assistant for introductory biology classes. In my free time, I participate in cancer immunotherapy research which focuses on melanoma.

I am a rising sophomore at Harvard College, currently on leave for the semester. I am a B.A. candidate in mathematics and physics, and I have both professional and academic experience in computer science as well.

A strong computer science education isn't just about writing code — it's about thinking algorithmically, understanding data structures, and knowing when a brute-force solution won't scale. Sarah is pursuing her CS degree at Saint Vincent College and brings hands-on experience with languages like C++ and Python to break down topics from recursion to sorting algorithms.

I am a graduate from Rochester Institute of Technology with a master's in Game Design and Development. My passions lie in everything related to games and mathematics. In the past, I have tutored various subjects in mathematics throughout high school and college, including but not limited to Algebra, Algebra II, Trigonometry, Calculus, Discrete Mathematics, Mathematics of Graphical Simulation, and Linear Algebra. As for technology, I am more than happy to reach out for help in Web Development (HTML, CSS, Javascript) or C# programming. I believe that every person can learn any topic. While every individual has different tastes, strengths, and weaknesses, there is no such thing as an "incapability" to know a subject. Education often possesses a guise of anti-fun, but I can promise you that all topics can be engaging, and I am willing to show you how engaging mathematics and technology can be. As a Game Designer, I have a deep interest in both playing games and making games. This includes games of all kinds: video games, board games, tabletop role-playing games, trading card games, miniatures, and even some sports like tennis or ping pong. Games act as a fantastic teaching tool. They teach by design without users recognizing. It is always a satisfying moment when somebody says "I learned that word from Magic" or "D&D taught me that." Remember: you can succeed. If something is important to you, then it's always worthwhile.

Hello, my name is Paul, and I am passionate about helping students in the areas of computer science and math and making sure that no question goes unanswered! I can guarantee a safe environment where hard work and creativity will be the basis for success! Let's have some fun solving problems!

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 automata theory and computational complexity to practical algorithm design, Firas covers computer science as both a theoretical discipline and a hands-on craft. His Ph.D. research at the intersection of machine learning and big data means he can connect abstract CS concepts — graph traversals, runtime analysis, NP-completeness — to the systems that actually use them. Rated 5.0 by students.

Isabella TA'd multiple computer science courses at MIT, so she's seen exactly where students get stuck — whether it's tracing recursive calls, understanding how data structures like linked lists and trees actually work in memory, or debugging logic errors in their code. She explains the underlying concepts so that writing correct programs becomes intuitive rather than trial-and-error. Rated 5.0 by students.

As an engineering student at Brown, Kashish works with programming languages and computational thinking daily — from writing algorithms to debugging code and understanding data structures like arrays, linked lists, and trees. She breaks down abstract CS concepts by connecting them to concrete problems, making topics like recursion or object-oriented design click for students encountering them for the first time. Her analytical precision and 5.0 rating make her a strong fit for introductory through intermediate computer science.

Studying computer science since before college and now pursuing a master's at UMass Amherst, Milo covers the full stack — from data structures and algorithms to systems-level concepts like memory management and concurrency. He spent three years in his university's tutoring center breaking down topics like recursion, sorting complexity, and graph traversal for students at every level.

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.

Jeff tackles computer science by connecting abstract concepts like recursion, data structures, and algorithmic complexity to concrete problem-solving steps students can follow. His science background means he's comfortable with the mathematical logic underlying CS, from Boolean algebra to Big-O analysis.

John transitioned from law into co-founding a software company, which meant teaching himself to think in algorithms, data structures, and system design under real deadlines. He approaches computer science the same way — breaking problems into smaller, solvable pieces before writing a single line of code. That builder's mindset makes debugging and logic design feel less intimidating.

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.

From recursion and sorting algorithms to Big-O analysis and object-oriented design, Ethan covers core computer science concepts with the rigor of someone studying it as a second major alongside aerospace engineering. He emphasizes understanding why an algorithm works — tracing through execution step by step — so students can adapt their thinking to new problems on exams and in projects.

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.

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.