Go Dutch Photographs

Hello

I am your new official blogger.

int main ()
{
cprintf("Hello, world", "ff00ee");
return(0);
} // print in some random color


As you can guess I am a C programmer or I wish to call myself that.
Anyways here is adding some useful information to the blog about the topics being covered today:

Deep Dive
15:30 Google Engine: Prasant Gopinath
16:00 Adaptive Resonance Theory : Anshum / Yavar
16:25 XSL Transformations with Symfony : Mohit
16:45 Naukri Search Engine : AdityaV and Ravi

Patiala Peg(brace yourself)
17:15 Memcachedb by Rajeev Rai
Code Jam
17:30 War of the Geeks.







-Amresh-

Go Dutch Episode III

The Go-Dutch Episode III has been just announced!
Scheduled for the 17th of April,2009 it gives the participants with enough room this time to do their home work and prepare for the events.
Event list? Yes, it remains almost the same:

1. Deep Dive: 1 hour 30 minutes
2. Wall Breaker: 30 minutes
3. Patiala Peg: 30 minutes
4. Code Jam: 30 minutes

Keep watching for more updates on the same! :)

Happy Dutching!

In Pictures!

Go Dutch @ Info Edge!

Its time for some patiala peg!

Pulkit Swarup from Naukri Tech steps in to talk about XMPP - An overview of the protocol. He talks about the current usage of XMPP by various messaging clients and proposals for usage by participating teams for developing new clients.
A nice comparison between OpenFire Vs Jabbered and eJabbered by him shows that when OpenFire implements XMPP to over 96% this is down at 30-40% in case of Jabbered and eJabber.

Next we have Kasa Shirish to compare Android SDK with iPhone SDK. Advatages of using an android SDK over an iPhone SDK is the freedom of use and the open source nature of android. Also the freedom of connectivity with external devices like USB drive in case of android make it a better choice. A nice demo of the Android SDK at least makes me a fan of android! :) Plus its OPEN SOURCE!
That was a good presentation... though stretching a little on time.. but worth each minute stretched...


The next presentation up would talk about MogileFS.. the distributed FS. Taken up by Aditya Seth and Sameer Garg. They talk about the need and use of a distributed file system

Lets get the code flowing... CodeJam....

I wonder on one thing, if its code flowing all around... why christen it as CodeJam?
(I know... might be a bad one... but thats how we are.... atleast the two of us blogging here...)

The code jam is up... and I see 2 good questions.... I thought all this while that it would be tough.... lets see how it shapes up!

With 15 minutes to solve them, here are the questions.....
Problem 1:

Given the Top-Right (x1,y1) and Bottom-Left (x2,y2) integer co-ordinates of two Rectangles parallel to the X-Y axes, Write a program to find the area of the rectangle formed by the intersection of the two given Rectangles.

Note:

• The co-ordinate system is such that x increases from left to right, and y increases from bottom to top.
• If the rectangles are non-intersecting, then the area is 0.
• If one rectangle is contained inside another, the area of intersection is the area of the smaller rectangle. Else If the two rectangles share a common edge and have no common area, then also the area (output of your program) is 0.

Input Definition:

1. On the first line, x1 y1 x2 y2 for the first rectangle
2. On the second line, x1 y1 x2 y2 for the second triangle

Output:

1. A single value representing the area of the intersection of the given rectangles

Problem 2:

Given an NxM Grid (N rows and M columns) find the number of rectangles that are there on the grid. Assume the grid to be having a coordinate system with bottom-left corner as the origin (0,0). Write program to Output the coordinates of the left-top and right bottom vertices of each of the rectangles in a sequential order.

Input :-

value of N and M on the same line, in a file or on the console.
e.g. 8 8

Output :-

(x11, y11) (x12, y12) |--> top left and bottom right vertex of the first rectangle

(x21, y21) (x22, y22)

:

:

(xr1, yr1) (xr2, yr2) | where r is the no. of rows of output (total no. of rectangles).

e.g. for input 8 8 output would be:-

1296

(0, 0) (1, 1)

(0, 0) (1, 2)

(0, 0) (1, 3)

:

(1, 1) (8, 8)

:

(M, N) (M+1, N+1) or (8, 8) (9, 9) | total 1296 rows of coordinates.

Breaking the wall - The First Hammer!

An empty mind is a devils workshop.... trust me... an empty stomach is worse!
We had a break.... and we are back!
Wall Breaker is on and Vikas has flagged it off. His current concern being Boolean operations on Large datasets. He is currently looking at better ways to exclude documents or efficiently run a 'NOT' query.
With suggestions coming in from all directions he should be feeling better! :)
The session ends with no result, but with a better perspective perhaps! :)

The next speaker we have is Manish Gulati from shiksha. Talking about search efficacy he discusses about what is more important as a factor in case of search and search results.
Interesting thoughts I must say!