swoup
New Member
"I thought what I'd do was I'd pretend I was one of those deaf-mutes" - Salinger
Posts: 5
|
Post by swoup on Jul 14, 2013 15:30:32 GMT -5
Hi everyone, I'm a newcomer here and i'm currently studying Informatics and Computing Engineering (2nd year) in Paris, France. I'm going to study during three months in Malaysia this autumn, so if there are forum members working in Kuala Lumpur, let's have a drink together in a couple of month I'm interested in computer sciences, biological computing and robotics, entrepreneurship, differents cultures, cyberpunk universes and many other things. I'm also vice-president in a small vocational training business and IT service provider (sending IT students to train employees on various softwares/ITnotions or to provide technical services . Low prices for companies but very well paid from a student point of view, high "engineer quality" and student dynamism, the aim is to help as many students as possible to pay the school fees). I'm looking for a programming project this summer to improve my resume and to keep me occupied in a productive way (i'm on holidays, waiting nervously for my exams results). I hope to find a lot of interesting topics and people here Best regards. Bolde Swoup.
|
|
|
Post by Hellfire on Jul 16, 2013 6:47:33 GMT -5
Welcome!!
|
|
swoup
New Member
"I thought what I'd do was I'd pretend I was one of those deaf-mutes" - Salinger
Posts: 5
|
Post by swoup on Jul 16, 2013 17:46:41 GMT -5
Thanks.
Not really a living place, isn't it ?
|
|
|
Post by jonwachob on Jul 17, 2013 20:09:34 GMT -5
Welcome!
If you are interested in object-oriented programming check out code school
|
|
swoup
New Member
"I thought what I'd do was I'd pretend I was one of those deaf-mutes" - Salinger
Posts: 5
|
Post by swoup on Jul 18, 2013 7:10:42 GMT -5
Awesome ! \o/ Thanks a lot ! A link for a link : Project Euler is a website that gather some little maths/programming problems. The first ones are reeeeeaaaally easy but the difficulty increase little by little. I use it as training to find, each time, the smallest possible complexity in my algorithms (you can simply brute force the first onesn, but it's not interesting), and motivate myself by competiting with classmates. Thanks for the tip See you on the forum or the facebook page. Bolde Swoup.
|
|