PremiumRob H. A Level Computing tutor, GCSE Further Mathematics  tutor, GCSE...

Rob H.

Currently unavailable: for regular students

Degree: Computer Science (Bachelors) - Warwick University

Contact Rob
Send a message

All contact details will be kept confidential.

To give you a few options, we can ask three similar tutors to get in touch. More info.

Contact Rob

About me

Hi Folks!

I'm Rob, and I'm a computer science student at the University of Warwick. I can't wait to start tutoring you all on computer science, maths, physics, and more! I've always had a passion for assisting other with their education, often offering assistance to classmates if they were struggling.

I also love being able to inspire the next generation of mathematicians and computer scientists. I'm heavily involved with outreach events within my department, and I've spent time as a Microsoft Student Partner.

If you want to get in touch then just send me a mesage on the right. I look forward to hearing from you!

Subjects offered

SubjectLevelMy prices
Computing A Level £24 /hr
Computing GCSE £22 /hr
Further Mathematics GCSE £22 /hr
ICT GCSE £22 /hr
Maths GCSE £22 /hr
Physics GCSE £22 /hr

Qualifications

QualificationLevelGrade
MathematicsA-LevelA*
ComputingA-LevelA
PhysicsA-LevelA
ChemistryA-LevelB
Further MathsA-LevelA (AS level)
Disclosure and Barring Service

CRB/DBS Standard

No

CRB/DBS Enhanced

28/03/2014

Currently unavailable: for regular students

Ratings and reviews

5from 8 customer reviews

Adam (Parent) April 30 2016

class

Bella (Student) March 31 2016

really good, helped so much highly recommend Rob!

Zak (Student) February 1 2016

Very helpful!

Ed (Student) January 31 2016

Did everything he could to help
See all reviews

Questions Rob has answered

What is the main difference between the Stack and the Queue abstract data types?

Queues are FIFO (first in, first out) data types. That is, the first object to be queued is the first objected to be dequeued. Stacks are LIFO (last in, first out) data types, meaning that the last object pushed onto the stack is the first object to be popped from the stack.

Queues are FIFO (first in, first out) data types. That is, the first object to be queued is the first objected to be dequeued. Stacks are LIFO (last in, first out) data types, meaning that the last object pushed onto the stack is the first object to be popped from the stack.

1 year ago

326 views
Send a message

All contact details will be kept confidential.

To give you a few options, we can ask three similar tutors to get in touch. More info.

Contact Rob

Still comparing tutors?

How do we connect with a tutor?

Where are they based?

How much does tuition cost?

How do tutorials work?

Cookies:

We use cookies to improve our service. By continuing to use this website, we'll assume that you're OK with this. Dismiss

mtw:mercury1:status:ok