Programming Tuition Online for University Students
Programming for degree and diploma students in C, C++, Java or Python: from variables, selection and loops to functions, arrays, objects and recursion.
Founder & Head of School, Afterkelas
Afterkelas tutors programming online for university and diploma students in computing, engineering, mathematics and data courses. Tutors run live classes, 1-to-1 or in small groups, in the language your course uses, from tracing code to designing programs.
What a first Programming course covers
The core topics of a first programming course, in whichever language your course uses. Each university sets its own order and depth, so the tutor works from your course outline.
Core topics
13 topics- Problem solving and algorithms
- Variables, data types and operators
- Input and output
- Selection
- Repetition
- Functions and parameters
- Arrays and strings
- Pointers and references
- Structures and classes
- Object-oriented programming
- Recursion
- File handling
- Debugging and testing
Thinking in steps
A first programming course teaches two things at once: a language's syntax and the habit of breaking a problem into precise steps. Tutors work on both, with extra time on the second: tracing code by hand, writing pseudocode first, and testing small pieces before building larger programs.
Where marks are lost
Practical tests lose marks to loops that run one time too many or too few, variables used before they are set, and code that works for the sample input but not for edge cases. Written exams lose marks when students cannot trace what a short program does. Tutors set tracing exercises, like the worked problem below, and edge-case tests for every exercise.
Assignments are your own
Programming assignments and projects are assessed as the student's own work, and copied code is treated as misconduct. A tutor explains concepts, works through similar problems and helps the student understand why their own code fails, but does not write any part of assessed code.
A question, worked through
A tracing question on recursion. Following each call down to the base case, then back up, gives the answer.
Question
A function f takes a whole number n. If n is 0 it returns 0; otherwise it returns n + f(n − 1). What does f(5) return, and how many calls to f are made?
- f(5) = 5 + f(4), f(4) = 4 + f(3), and so on down to the base case, f(0) = 0.
- Working back up: f(1) = 1 + 0 = 1, f(2) = 2 + 1 = 3, f(3) = 3 + 3 = 6, f(4) = 4 + 6 = 10.
- f(5) = 5 + 10 = 15, the sum of the whole numbers from 1 to 5.
- The calls are f(5), f(4), f(3), f(2), f(1) and f(0): 6 calls in total.
Answer f(5) = 15, using 6 calls.
Frequently asked questions
Which languages do your tutors teach?
The tutor follows your course's language, such as C, C++, Java or Python, and the style your lecturer expects.
Can a tutor write my assignment code?
No. Assessed code must be your own. The tutor explains the concepts, works through similar problems and helps you debug your understanding, which is also what practical tests and exams check.
I have never programmed before. Can I catch up?
Yes. Tracing simple programs and writing small ones every week builds the habit steadily, and starting early in the semester gives the most room.
How much does Programming tuition cost?
The fee depends on the format (1-to-1 or a small group), how many classes a week and the tutor, so there is no single figure. Send an academic advisor the university, the course code and the language your course uses on WhatsApp, and you will get the current packages and a quote, usually within one working day.