Introduction to Computer Science - the course that separates UofT CS students who struggle from those who thrive.
Recursion, linked lists, trees, sorting - I'll make them click for you.
āØ First Hour FREE!
Most students from CSC108 have never had to think recursively. The moment the prof puts a recursive function on the board, half the class gets lost. We fix that with targeted practice until it clicks.
Linked lists are manageable, but trees add a dimension most students haven't dealt with. Traversals, BST invariants, and recursive tree operations are the #1 source of assignment panics.
Each assignment builds on the last. Fall behind on recursion and you're lost by linked lists. Fall behind on linked lists and trees become impossible. The time to get help is early - not the night before.
AI writes a recursive tree traversal instantly. That is exactly the problem. Recursion is the idea CSC148 is built to make you feel, and a function that works but that you never reasoned through teaches you nothing about the base case.
A correct linked list insert, a working BST delete, a merge sort that passes the tests. All in seconds, all before you have any picture of what the nodes are actually doing.
Trace this recursive call by hand. Draw the tree after these three inserts. State the Big-O and justify it. None of those are answered by code that ran correctly on your laptop last week.
You keep AI for explanations, hints, and extra practice. Then you rebuild the structure from an empty file, draw it before you code it, and say the base case out loud. Same tools, different student.
None of this makes you a bad student. It makes you a student learning to code in the AI era.
Before writing a single line of code, I make sure you have a clear picture of what the data structure looks like and how it behaves. Diagrams, analogies, step-through walkthroughs.
We write code together in real time. I ask questions, you think it through, I fill in gaps. You leave each session able to reproduce the solution yourself.
I know the recurring patterns in CSC148 assignments. We practice the exact types of problems that show up so you're not seeing them cold on the due date.
Big-O trips up students on exams. I teach you a systematic approach: how to identify loops, recursive calls, and nested operations, and translate them to O(n), O(log n), O(nĀ²).
The best time to get help is before you're panicking. Book a free first session and let's get you on track.
š Book Free First SessionNo commitment. See if we're a good fit first.
Want to know how much of CSC148 you can do with AI closed? Take the free AI Coding Dependency Test.
Very. CSC108 is relatively gentle; CSC148 introduces recursive thinking and complex data structures that require a different way of approaching problems. Almost every student feels the jump. It's fixable with targeted practice.
First hour is FREE! After that:
Not at all. Three days is enough to get clear on the key concepts. Message me immediately and we'll build a focused crash plan.
I help you understand the problem and the relevant data structure so you can write the solution yourself. I won't write it for you - that would just hurt you on the final exam.
With one data structure, not the whole course. Pick linked lists, rebuild the class from an empty file, and notice exactly where you stall. That spot is the real gap, and it is almost always smaller than it feels. If you want a wider read first, the free AI Coding Dependency Test does the same thing across 10 skill areas in about 15 minutes.