Online help for COMP 2402 - Abstract Data Types and Algorithms. Clear explanations, clean code, and faster assignment progress.
Back to Carleton University tutoring.
Big-O (Java)
lists/stacks/queues (Java)
trees (Java)
hash tables (Java)
sorting (Java)
Coding in the AI era
COMP 2402 is the course where working code stops being the point. ChatGPT will implement a hash table, a balanced tree, or a sort in seconds, and then the exam does not ask you to implement it. It asks which structure fits the constraints, what the amortized cost is, why doubling an array gives amortized constant time, and how you would argue a bound.
Those are reasoning questions, and a confident wrong answer about complexity is impossible to catch if you do not already understand the material. So you can finish every assignment and still walk into a closed book midterm with nothing to fall back on. None of this makes you a bad student. It makes you a student learning to code in the AI era.
Try the free three-step self-check with AI closed. Explain, change, and debug your own code to see where you need help.
Not by itself. The catch in this course is that AI is strongest at the part you are least graded on. It will produce a working implementation and a confident sounding complexity claim, and if that claim is wrong you have no way to tell. The exam tests the reasoning, not the typing, so that is what we work on. The free AI-Era Coding Help offers a three-step self-check you can try without AI.
Tutoring is taught by Joseph Abate, a software engineer with 6 years writing production code and 8+ years tutoring computer science. Over 500 students across college and university programming courses so far.
Sessions run online across Canada, and in person around Toronto and the GTA. No contract and no minimum commitment. I guide the work, you write and submit your own.