I'm a software developer from Swansea. I've started my career at an early age and since then I'm always improving my programming skills and getting knowledge on new technologies. I finished my computer-science degree with First Class.
• Working on RAP NET, a risk-assesment permit to work manager;
• Working in a big team (20 people);
• Using multiple databases (oracle, mssql, mssql2012).
Managing Developer
Creative Programming LTD
2月 2012 - 12月 2013 (1 年, 10 个月)
• I created a small, private company where we developed web crawlers and parsers in order to automatise web tasks.
• With a small team of only 5 employees our product was sold to thousands of clients.
• We also collaborated with Cosmote Romania, developing all the software and websites required in their smileydelivery.ro campaign.
CTO
Traderion.com
8月 2012 - 2月 2013 (6 个月, 1 天)
• I was the CTO during the development of the online banking game Traderion.com.
• I managed a small developing team, consisting of 5 people.
• The game simulates a real-world economy and lets the players feel the insights of inter-banks trading.
• It was a challenging project because it needed processing of a lot of data in real-time on cheap hardware.
教育
Computer Science - First Class Degree
University of Wales, Swansea,
United Kingdom 2010 - 2013
(3 年)
资质
Special prize and the special jury prize
InfoEducatie, national competition, web-pages section, Romania
2009
Won special prize and a special award from the jury for activity at the InfoEducatie, national competition, Romania.
The contestants had to develop a web application prior to the contest and then develop another application in 24 hours during the competition.
Special prize
National Olympiad of Informatics, Romania
2009
Won special prize at the National Olympiad of Informatics, Romania.
The contestants had 5 hours to solve 8 high-complexity algorithmic problems.
Special prize (8th place)
National Olympiad of Informatics, Romania
2010
Won 8th place at the National Olympiad of Informatics, Romania.
The contestants had 5 hours to solve 8 high-complexity algorithmic problems.