Ashishalchemy's Blog

Facebook is killing my time………….

Ashishalchemy — Sun, 20 Feb 2011 05:39:19 +0000

Obsession has reached new height!! This is the basis on which these social site survive. Reason being that everybody wants to get noticed by their friend and are hungry for their comments. More the comment one has on its wall more famous he will be considered by others. This is the general perception of user. They request for comment even.
In this lust for comment many person has not even hesitated to put their well kept secret to public post. This in turn may lead the hacker to steal information.
They have gone to such an extent that they even plan their day so that they can get something to publish on their social website. Hope we come out of this mania soon.

Finding the middle of a singly linked list which has a cycle in it.

Ashishalchemy — Tue, 30 Mar 2010 14:54:46 +0000

Simplification of the problem would be find the node where the cycle starts then we can easily proceed as we do in singly linked list.

1->2->3->4->5->6->7->8->5 in this case it is 5

let pt1 points to 1(start node)

step 1: Find one of nodes inside the cycle..

Proceed in the same way as we go to find whether cycle is there in the linked list or not..

Take 2 pointers increase one pointer ( pt2) by 1 and another pointer(pt3) by 2

when they meet we get a pointer inside the cycle(pt4) of the linked list..

step 2:

Find the length(l1) of the list from pt1 to pt4 and then length(l2) of the cycle(pt4 to pt4) . .

Now increase the highest length pointer by |l2-l1|..(i.e. if l1 is greater increase it by l1-l2.. l2 is greater increase it by l2-l1..)

Now increase both the pointers in the same manner i.e. pt1 and pt4 when they meet we get the point where the cycle starts.

step3:

Now we know the start pointer and the end pointer…proceed in same manner as the finding the length in the non cyclic linked list..

Efficiency: O(n)

Recursive Acronyms

Ashishalchemy — Mon, 05 Oct 2009 15:52:52 +0000

It is believed that only 5 percent of people think recursively, the rest 95 percent have iterative thinking. I am glad I am among the unique 5 percent ones . I have always been a recursive thinker. I think and think until I cannot think anymore. I have been thinking for the past three days for drafting an attractive poster for the Adobe Flex Workshop, and today I met rookshop and ID, and made them think about it. I am definitely a recursive thinker, no wonder I am so slow at thinking and I often forget what I was my original thought process, and my brains often crashe like Windows. (for the starters, recursion consumes a LOT of memory)

I have loved Linux and especially Ubuntu also because they have really cool recursive acronyms. ( A couple of hours ago, RDP had chuckled at the very idea of recursive acronyms while the know-it-all-chap ID sat smiling. RDP also happens to be the technical guy of the Board.)Anyway, Two of the most common ones are :

GNU : GNU is Not Unix

WINE :Wine Is Not Emulator

However the distinction of being the first recursive acronym goes to JINI , which stands for Jini Is Not Initials. Whats more, JINI never stood for anything in the first place !

Some companies have also chosen recursive acronyms for their name :

VISA : Visa International Service Association

OIL : Oil India Limited

Isn’t the entire idea fascinating?

~Quote Of The Day~

~” 67% of all statistics are made on the spot “~