I am currently studying Mathematics at Durham University. Maths can sometimes be intimidating, but it's that which makes it so rewarding when it all starts to make sense.
I have been teaching in one form or another since 13, teaching swimming to a range of ages, helping teach in local schools, and most recently I ran an after school programming class at a local secondary school.
It is important to me that you get what you want out of a tutorial, I will personalise a tutorial to suit you. Everyone learns differently, I will try to find how you learn so that the experience can be easier, and hopefully more enjoyable too!
Above all I will encourage you to make requests to make tutorials more effective!
I am able to help with some GCSE and A-Level Computing or Computer Science, but I have stopped tutoring the subjects due to rapidly changing syllabus' and not having access to the latest resources.
I do offer tutoring for most programming languages as I've worked on large projects in a number of languages.
You can see a rough timetable below, this is subject to change and the times are approximate.
IMPORTANT: Unfortunately I cannot take on any more students until after Christmas.
|Computing||A Level||£22 /hr|
|Maths||A Level||£22 /hr|
|Before 12pm||12pm - 5pm||After 5pm|
Please get in touch for more detailed availability
Caroline (Parent) May 8 2016
Suhail (Parent) March 12 2016
Georgi (Student) January 25 2017
Georgi (Student) October 5 2016
Using "Integration by parts" or "reverse chain rule" .
Recall formula for intergration by parts: "∫f'(x) g(x) dx = f(x)g(x) - ∫f(x)g'(x)dx"
Then set f'(x) = 1, g(x) = log(x). Can calculate f(x) = x, g'(x) = 1/x.
Then plug into the formula to get ∫log(x)dx = xlog(x) - ∫1 dx = xlog(x) - x +csee more
A queue is a FIFO (First In First Out) data structure.
Analogous to a production line, the first item in the list will be the first to be removed, the second the second and so on.
A stack is a LIFO (Last In First Out) data structure.
Analogous to a stack of plates, every new data entry is placed (or pushed) onto the top of the stack, and to get the the data below it, you must first remove all the data above it.