CodeChef on Campus - November 2009 |
Hi Guys,
Welcome to the 2nd edition of CodeChef on Campus.
We know that exams are round the corner, so we're going to keep this one short and sweet. This newsletter covers:
· CodeChef Campus SnackDown
· Topic of the Month with Recommended Campus Activity
· Campus Chapter Updates
CodeChef Campus SnackDown
We hope you saw our Super Gigantic Mega Announcement about the CodeChef Campus SnackDown! This is a team based contest open to all students within India - so register your team today!
Prizes: Rs 3,00,000 to be given out in cash as prizes
Contest Dates: Online round 21st Nov., 07:00PM to 12:00AM (mid-night). Onsite round 10th Jan 2010. Top teams to be flown down to Mumbai.
Participation: 3 students from the same college may form a team
Format: Standard ACM ICPC style contest with penalties for wrong answers.
Registration date: On or before 20th November '09 midnight
Registration Link: http://www.codechef.com/teams/register/SNACKDWN.
We have sent out posters addressed to Students Representatives of all our Campus Chapters. Let us know if you see them around your campus or if you need more.
Topic of the Month - Graph Theory
Overview
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. Many problems which ask for the shortest path from a node A to a node B can be solved using BFS. A BFS is very simple to implement in C++ using readymade data structures like the 'queue' in the standard template library. One of the major parts of a BFS related problem is the representation of a state. The following tutorial gives a sample implementation of a BFS for a problem in which representing a state is not that simple.
Tutorial:
CodeChef Video Tutorial : A Puzzle Game by Aniruddha Laud from Directi on Vimeo.
Suggested Activity
· Solve the problem with the help of the tutorial.
· Discuss strategies to reduce runtime and to optimize the method mentioned in the tutorial.
· Implement the code without using any STL related features in C++.
Additional Resources
http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=graphsDataStruc...
http://en.wikipedia.org/wiki/Breadth-first_search
http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgo...
Campus Chapter Updates
During the month of October CodeChef was host to multiple Campus Contests. You can check them out here:
College: Thapar University
Campus Representative: Ankit Babbar
Contests: Aranya 09, Anranya Knight Coders Round 1 and Round 2, Aranya Reverse gear
College: Netaji Subhas Institute of Technology
Campus Representative: Rupinder Singh
Contest: NSIT
College: Visveswaraya National Institute of Technology, Nagpur
Campus Representative: Sanjay B. (Responsibility has been passed on to Ankur Jain)
Contests: Axis Round 1, Round 2, Round 3 And Insomnia
College: Delhi College of Engineering
Campus Representative: Sailesh Mittal
Contest: CodeBaker
Kudos to all our Campus representatives and their teams who are behind the success of these contests!
Thank you for writing back to us at campus@codechef.com and for sharing the October Newsletter on your blogs :) Keep us updated on what your CodeChef Campus Chapter is up to!
ALL THE BEST FOR YOUR EXAMS!!
Cheers!
Anusha Pinto
Community Evangelist
CodeChef
http://www.codechef.com
Comments

