Marriage does wonders..

Ppl say marriage does wonders.. :) I am yet to see. But all I can say right now is that wonders start much before that ;)...

More thoughts are still uncooked.. coming soon ..

Kernel programming from a philosophical viewpoint

Thoughts are in process ................ coming soon !

Data Structures and Algorithms:

* Find the loop in a linked list and fix the cycle.
very good explanation and soln. are given in :
http://www.tekpool.com/?p=16
http://k5rec.blogspot.com/2006/12/c-programming-removing-loop-from.html

Though I am yet to work out on the solutions.. But theoritically they look perfect.

A scratch on the data structures (Live)

Found some good data structures (thinking!) questions.... Possible answers follow the question.

1. A string stored in a singly linked list. Find a best (space + time) way to find if string is a palindrome string - "A string can be called palindrome, if it is same from forward and backward". Assume the length of string is known.

A1: Store the string into an array and then start comparing from both end points until the pointers meet each other.

A2: Push the link list elements into a stack until midpoint, and then starting popping them while other pointer traverse and compare from midpoint to end.

A3(Best Soln): Reverse the link list till the midpoint, and then compare first element with middle element and so on.

----------------

ek chidiya, anek chidiya

The days when I used to love life ........



Doordarshan rocks, atleast not spoils the life ..