Facebook Login and Facebook Sign Up General Safety Tips Click Here!!!

Apply for Google Summer of Code 2011

April 2, 2011

Every year Google holds a global competition which encourages students to write code for open source projects. Google even offers the students a stipend to write code all summer.

Google has announced that it will start accepting applications for the Summer of Code 2011 program.

How will Google Summer of Code 2011 work?

  • The concept is simple. Through March, Google invited organizations to be part of Summer of Code program. Some of the major participating organizations are Apache, Mozilla, Melange, Wikimedia, Drupal and WordPress.
  • Now in April, students have to register along with proposing a project for approval by a participating open source organization.
  • Once the proposal is accepted, students can write code all summer from April to September. Hence the name Summer of Code.


  • The age limit for participants is 18 years old or over.
  • The students also need to be enrolled in a college program. If they are graduating in the summer they need to be enrolled in a college on 26th April 2011.

For complete details on Eligibility click here.

The Prize

  • Other than boasting rights; the participant get a hefty cash prize if their projects are selected by Google.
  • Also very often Google end up recruiting the participants who do well. This is not really a declared part of the prize but even Google admits it does hire from the program.

Link: Google Summer of Code 2011

    You May Also Be Interested In...

  1. India Sri Lanka World Cup Final 2011 Match Fixing News by WikiLeaks is Fake
  2. India-Sri Lanka Match Fixing Cricket World Cup 2011 (WikiLeaks Cricket)
  3. Who will win Cricket World Cup 2011, India or Sri Lanka..??
  4. Live streaming of ICC CWC 2011 in Vodafone
  5. Claim Free T-Shirts From eBay

{ 1 comment… read it below or add one }

1 Emmanuel Ugbe June 28, 2011 at 1:33 pm

Send me the code updated on June 2011


Leave a Comment

CommentLuv badge

Previous post:

Next post: