Microsoft and Pragyan, NIT Trichy presents Hackathon 2015

Last Updated : 21 Dec, 2016

GeeksforGeeks sponsors Hackathon 2015 as Coding Partners organist by
Pragyan, NIT Trichy

Microsoft and Pragyan, NIT Trichy presents Hackathon 2015 to be held at IFIM B School, Bangalore on 12th and 13th of December. It is a two day Hackathon where participants will have to develop a web/mobile app pertaining to the theme of the Hackathon.

-No constraints on the platform or language. Participants can form teams at the venue (team of 3).

-Prizes worth INR 1,00,000 and internships are at stake.

-All participants will receive a free merchandise, food for two days and stay at the venue overnight

Registeration Link:

Deadline : 25th Nov 2015.

Venue: IFIM B School, Bangalore

Date: 12th & 13th December

Follow for recent updates.

Theme of the Hackathon will be disclosed two weeks prior to the event.

Share your thoughts in the comments

Similar Reads

I_Hack 2018 - Hackathon by Entrepreneurship Cell IIT Bombay
At I Hack 2018, we bring together India’s best coders, developers, designers, innovators, creators and entrepreneurs of tomorrow. I Hack is geared up for those who are passionate about building, designing and innovating. It is a 48 Hr event where the enthusiasts meet, develop and compete in the product prototyping competition. We encourage all kind
4 min read
Microsoft Interview Preparation
[[Microsoft]] Microsoft Corporation, the name itself tells a lot about it. An American multinational technology corporation of personal computer software systems and applications, owned by Bill Gates. Under the umbrella of Microsoft, there are over 101 products, services, & apps, you probably don’t know about. To land a job for a role of SDE at Mic
1 min read
Microsoft topics for Interview Preparation
[[Microsoft]] Easy Level Medium Level Hard Level
1 min read
Remuneration Terms and Conditions
There are some Remuneration Terms and Conditions that an individual should know before joining as a Technical Content Writing Intern or Freelance Technical Content Writer at GeeksforGeeks. Firstly, the payment per article will be determined on a case-by-case basis, at the discretion of the company and depending on factors including but not limited
2 min read
Terms and Conditions
Mathematical Algorithms | Divisibility and Large Numbers
Recent Articles on Divisibility ! Recent Articles on Large Numbers ! Check if a large number is divisible by 3 or not Number of digits to be removed to make a number divisible by 3 Find whether a given integer is a power of 3 or not Check if a large number is divisible by 4 or not Count rotations divisible by 4 Number of substrings divisible by 4 i
4 min read
Mathematical Algorithms | Prime Factorization and Divisors
Divisors: Mathematically, divisor is defined as a number that divides another number completely or with a remainder. For example: Consider 6 / 3. Here 3 divides 6 completely. Also, consider 8 /3. Here 3 does not divide 8 completely. But in both cases, 3 is the divisor. Prime Factorization: Prime factorization is a very common topic of mathematics a
3 min read
Mathematical Algorithms | Prime numbers and Primality Tests
What is Prime Number? A prime number is a natural number greater than 1 that is divisible by only 1 and the number itself. In other words, the prime number can be defined as a positive integer greater than that has exactly two factors, 1 and the number itself. First 10 prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29. Note: 1 is neither a prime
3 min read
GATE and Programming Multiple Choice Questions with Solutions
? C Programming Mock Tests ? C++ Programming Mock Tests ? Java Programming Mock Tests ? Python Programming Mock Tests ? GATE Mock Tests ? Data Structures Mock Tests ? Algorithms Mock Tests ? Operating Systems Mock Tests ? DBMS Mock Tests ? Compiler Design Mock Tests ? Computer Networks Mock Tests ? Theory of Computation Mock Tests ? Computer Organi
3 min read
Complete Guide to Recursion and Backtracking
In this complete guide to Recursion and Backtracking, you will learn about the basics of Recursion and Backtracking, how to get started with Recursion and Backtracking, learning, strategy, resources, problems, and much more.
4 min read