What CPSC 2620 Covers
This page is based on the public UofL course description, then translated into the tutoring work students usually need: debugging, lab strategy, concept review, project planning, and test prep.
Source used: University of Lethbridge course catalog. UofL describes CPSC 2620 as covering object-oriented techniques, classes, objects, methods, generic programming, recursion, abstract data types, lists, stacks, queues, priority queues, binary trees, searching, sorting, and algorithm analysis.
The code becomes structural
We map each class, method, and data structure to a responsibility so the design stops feeling like scattered syntax.
Recursion and trees need visualization
Sessions use call traces and diagrams so recursive code, binary trees, and traversal behavior become concrete.
Algorithm analysis is easy to fake until exams
We practice explaining runtime, choosing data structures, and comparing search or sort behavior under timed conditions.
How sessions help
Understand OOP and ADTs beyond memorized code
Debug recursion, tree, list, stack, and queue problems faster
Prepare for programming assignments and algorithm-analysis questions
Related UofL CPSC courses
CPSC 1620
Fundamentals of Programming I
Problem solving, algorithms, data representation, branching, loops, modular design, arrays, records, and robust programs.
CPSC 2720
Practical Software Development
Advanced OOP, inheritance, polymorphism, design, testing, correctness, collaborative projects, version control, UNIX tools, and scripting.
Free Consultation
Tell me your course + deadline and I'll reply with the fastest next step.