Soham Village College student beats thousands to make computing challenge finals
George Wood receiving his final round certificate from Peter Millican, professor of philosophy at Hertford College, University of Oxford. - Credit: Archant
A Soham Village College student has beaten thousands to make the finals of a computing challenge at the University of Oxford.
A Soham Village College student has beaten thousands to make the finals of a computing challenge at the University of Oxford.
George Wood was invited to the Department of Computer Science at the university on Sunday January 28 as a finalist in UK-wide computing competition The UK BEBRAS Computational Thinking Challenge.
Reaching the final of the senior age group is an impressive achievement, as 14,402 students entered the first round of the senior age group category (14–16).
George was among the top 60 highest achieving students invited to the final round in his age group, and was presented with his finalist’s certificate at a prize-giving ceremony at Hertford College.
You may also want to watch:
The UK BEBRAS Computational Thinking Challenge, supported by Google, is designed to get students excited about computing and computational thinking.
It is a problem-solving contest with questions inspired by topics in computer science.
Most Read
- 1 Dramatic pictures catch harvester on fire in 4am blaze
- 2 Illegal poachers stopped in their tracks by eagle-eyed public
- 3 'Loving, caring family man' dies in hospital weeks after A141 crash
- 4 Police pursuit of suspected hare coursers ends in success
- 5 Police investigation after village pavilion covered in graffiti
- 6 Meet the star cast of Christmas pantomime Sleeping Beauty
- 7 Envar deny responsibility for county's fly invasion
- 8 Mosque trust named RIBA client of the year 2021
- 9 Prison escapees found with stolen £30,000 car thanks to quick-thinking neighbour
- 10 Council expects to spend £2.4m less on older people due to 'Covid loss'
In the first round, held in their own schools, students have to try and solve as many problems as possible in the allotted time.
