Re: [algogeeks] Padding....

2011-09-03 Thread Karthikeyan palani
in 32 bit m/c 4 for int 1 for char + 3 padding 4 for float so, totally it takes 12 bytes.. On 03/09/2011, rahul sharma rahul23111...@gmail.com wrote: ans is: 16 i thninkj... float take 8 bytes so pdding is :- int take 4 bytes 1 char 3 bytes pad + 8 byte float=16 On Sat, Sep 3,

Re: [algogeeks] MICROSOFT

2011-09-03 Thread Karthikeyan palani
BST ?? On 04/09/2011, teja bala pawanjalsa.t...@gmail.com wrote: //Asked in MS please help me with the coding or Give an algorithm Write code to return the kth largest element in a tree ... function prototype is int fucnkth(node *root,int k) -- You received this message because you are

Re: [algogeeks] J.P.MORGAN

2011-08-19 Thread Karthikeyan palani
balaji +1 -- karthikeyankkn -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more

[algogeeks] matrix question ???!!!!!!!!!!??????????

2011-08-14 Thread Karthikeyan palani
Given a n x n matrix. .number are randomly placed. .print any one row which doesn’t have min and max elements. Time Complexity : 0(n) if anyone know the code.. pls share!!! -- karthikeyankkn -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group.

Re: [algogeeks] matrix question ???!!!!!!!!!!??????????

2011-08-14 Thread Karthikeyan palani
sorry O(n^2) s the time complexity On 14 August 2011 23:56, shady sinv...@gmail.com wrote: how can it be O(n) when there are itself n*n elements.. PS : no sharing of code, else the inevitable On Sun, Aug 14, 2011 at 11:51 PM, Karthikeyan palani karthikeyan...@gmail.com wrote: Given a n

Re: [algogeeks] matrix question ???!!!!!!!!!!??????????

2011-08-14 Thread Karthikeyan palani
code pls?? On 15 August 2011 00:16, aditya kumar aditya.kumar130...@gmail.com wrote: it can be done in O(3n). in worst case one row will have max and anothr row will have min so the third row will be your o/p to print On Mon, Aug 15, 2011 at 12:00 AM, Karthikeyan palani karthikeyan

Re: [algogeeks] C question

2011-08-10 Thread Karthikeyan palani
@ram got it. tanx :) -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options,

[algogeeks] C question

2011-08-09 Thread Karthikeyan palani
main() { char a=129; printf(%0x,a); } the o/p whch i'm getting s ff81.. why is tat so? as char s 1 byte why 2 bytes r printed... -- karthikeyankkn -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

Re: [algogeeks] shift left nd right

2011-08-08 Thread Karthikeyan palani
s greater than operator , 20 1 is 1 as 20 s greater than 2 On 8 August 2011 22:20, Shashank Jain shashan...@gmail.com wrote: thx dipankar, its a gud 1! Bt tell me wat does '' and '' operators do? eg: 202 = 1 can u explain nd wat is this operator called? Shashank Jain IIIrd year

[algogeeks]

2011-07-30 Thread Karthikeyan palani
Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. NOTE: One or two additional variables are fine. An extra copy of the array is not. -- karthikeyankkn -- You received this message because you are subscribed to the Google