int a=256;
imagine integer is 4 bytes.
so in memory it will look like this
--last byte..
0001--- p
---starting byte of a
but the char pointer is pointing to 1 byte of integer,
u incremented it point to 2nd byte
and assigned the new value 2(it was 1 before)
so it
Congrats and thanks for inputs in the blog.
--
With love and regards,
Sairam Ravu
I M.Tech(CS)
Sri Sathya Sai Institute of Higher Learning
To live life, you must think it, measure it, experiment with it,
dance it, paint it, draw it, and calculate it
--
You received this message because you
hican ne1 suggest good books for dbms...not theory types but more of a
question bank like maybe a cracking the coding interview is for
coding/algo...
thanx :)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
thanx a ton
one more query...
was mcq is in online test?
On Fri, Sep 23, 2011 at 1:54 AM, aditya kumar
aditya.kumar130...@gmail.comwrote:
those three question they ASKD me in interview nt in coding round n they
are very particular abt coding
On Fri, Sep 23, 2011 at 1:53 AM, aditya kumar
and would u like to please tell me the online coding questions...
On Fri, Sep 23, 2011 at 1:10 PM, sagar pareek sagarpar...@gmail.com wrote:
thanx a ton
one more query...
was mcq is in online test?
On Fri, Sep 23, 2011 at 1:54 AM, aditya kumar
aditya.kumar130...@gmail.com wrote:
Hello everyone,.
I am 3rd yr student from IIIT Allahabad,i want to know what
companies I can apply for summer(2012) internship and what is the process
for applying in these companies.My CGPI is around 8.Please reply as soon as
possible.
--
Mohit kumar lal
rit2009014
IIIT ALLAHABAD
any one pleae help which type of question are asked for interns in D.E
shaw
some recent question will surely be of great help
--
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
thank you dave.
any idea how to handle such questions in placement papers?
On Sep 22, 8:06 am, Dave dave_and_da...@juno.com wrote:
@Himanshuarora: This code violates the sequence point rule (google
it), which essentially says that a variable can change values at most
one time between sequence
You have a library provided by the vendor. All you have is header files and
library files.
Library contains the class Shape and there is whole hierarchy tree (i mean
classes which derive from this base class).
Now you want to add some function getArea (not originally present in the
class or any of
You have a library provided by the vendor. All you have is header files and
library files.
Library contains the class Shape and there is whole hierarchy tree (i mean
classes which derive from this base class).
Now you want to add some function getArea (not originally present in the
class or any of
yes mcq's wer in online test .
1st coding question was to print all ascending lexical order of ()
http://chinmaylokesh.wordpress.com/2011/02/23/catalan-number-combinatorial-problem-print-all-valid-properly-opened-and-closed-n-pairs-of-parentheses/
here
is the soln
2nd was very easy array problem
Think it as following...
(++i + ++i) + ++i;
i.e.
(7 + 7) + 8;
1) calculate ++i i.e i=6
2) calculate ++i i.e i=7
3) calculate (i + i) i.e (7+7) = 14 because i is now 7
4) calculate ++i i.e i=8
5) calculate 14 + i i.e 22
--
You received this message because you are subscribed to the Google
Prepare for CAT apti...
--
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,
This is Simple query related to Factory Design Pattern... Have a look at the
Auto Registration of Factory Design pattern..
:)
Prem
On Fri, Sep 23, 2011 at 3:02 PM, algo geek geeka...@gmail.com wrote:
You have a library provided by the vendor. All you have is header files and
library files.
Congrats bro...
--
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, visit
its 21 .
On Fri, Sep 23, 2011 at 4:10 PM, vijay singh vijaysinghb...@gmail.comwrote:
Think it as following...
(++i + ++i) + ++i;
i.e.
(7 + 7) + 8;
1) calculate ++i i.e i=6
2) calculate ++i i.e i=7
3) calculate (i + i) i.e (7+7) = 14 because i is now 7
4) calculate ++i i.e i=8
5)
Yes, it already visited..
--
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,
its a telephonic interview ..please guide how to prepare...
and please post question if anyone had interview recently
--
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
hi all,
can anyone pls share the questions amazon has been asking in online written
tests.
thanks
raju
--
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
+1 dave
Its giving 97 in my compiler.
On Fri, Sep 23, 2011 at 4:22 PM, vishwa vishwavam...@gmail.com wrote:
its 21 .
On Fri, Sep 23, 2011 at 4:10 PM, vijay singh vijaysinghb...@gmail.comwrote:
Think it as following...
(++i + ++i) + ++i;
i.e.
(7 + 7) + 8;
1) calculate ++i i.e i=6
2)
Hi
Congrats
What did you answer for elevator problem ?
On 22 September 2011 18:42, saurabh sah.saurab...@gmail.com wrote:
thanx to all
I have shared my interview experience at
http://msidcinterview.blogspot.com/
--
You received this message because you are subscribed to the Google
Hi
On 23 September 2011 17:29, raju nikutel...@gmail.com wrote:
hi all,
can anyone pls share the questions amazon has been asking in online written
tests.
Search the archives
This has been answered many times in the recent days.
Best of Luck
thanks
raju
--
You received this message
prefix class as class time a,b,c,d; worked for me.
On Fri, Sep 23, 2011 at 12:09 AM, Rajesh Kumar testalgori...@gmail.com wrote:
thanx Rahul
On Thu, Sep 22, 2011 at 11:54 PM, abhinav gupta abhinav@gmail.com
wrote:
@rahul
+1
On Thu, Sep 22, 2011 at 11:20 PM, rahul vatsa
see the concept of LITTLE ENDIAN and BIG ENDIAN
On Fri, Sep 23, 2011 at 12:23 PM, vishwa vishwavam...@gmail.com wrote:
int a=256;
imagine integer is 4 bytes.
so in memory it will look like this
--last byte..
0001--- p
---starting byte of a
but the char
congrates dude
On Thu, Sep 22, 2011 at 7:26 PM, Sanjay Rajpal srn...@gmail.com wrote:
Saurabh : Thank u very much :)
Sanju
:)
On Thu, Sep 22, 2011 at 6:15 AM, saurabh sah.saurab...@gmail.com wrote:
thanx to all
@sanjay I have shared my interview experience at
yes realloc can be used to shrink the allocated memory. yes the remaining
memory will be freed.
IF we want to allocate more memory and if there is no enough room in that
particular boundary, i will allocate a new block ,copy the contents and
free the previous contents
On Thu, Sep 22, 2011 at
solve it.
--
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, visit this
If anyone has any idea about the process of Ebay and/or Yahoo! (especially
the questions asked), kindly post it here soon...it's visiting our campus on
Sunday..
Please help!
--
Regards
Vartika Aggarwal
Undergraduate Student
IT Department
NSIT, Dwarka
--
You received this message because you
Congrats Saurabh.
On Fri, Sep 23, 2011 at 7:18 PM, sagar pareek sagarpar...@gmail.com wrote:
congrates dude
On Thu, Sep 22, 2011 at 7:26 PM, Sanjay Rajpal srn...@gmail.com wrote:
Saurabh : Thank u very much :)
Sanju
:)
On Thu, Sep 22, 2011 at 6:15 AM, saurabh sah.saurab...@gmail.com
two
On Fri, Sep 23, 2011 at 7:25 PM, amrit harry dabbcomput...@gmail.comwrote:
solve it.
--
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,
R U SUREI DONT THINK SOO...? HAD U CHKED IT...?
On Fri, Sep 23, 2011 at 7:58 PM, rahul sharma rahul23111...@gmail.comwrote:
two
On Fri, Sep 23, 2011 at 7:25 PM, amrit harry dabbcomput...@gmail.comwrote:
solve it.
--
You received this message because you are subscribed to the Google
infinite i think not two... u can give many
On Fri, Sep 23, 2011 at 8:01 PM, amrit harry dabbcomput...@gmail.comwrote:
R U SUREI DONT THINK SOO...? HAD U CHKED IT...?
On Fri, Sep 23, 2011 at 7:58 PM, rahul sharma rahul23111...@gmail.comwrote:
two
On Fri, Sep 23, 2011 at 7:25 PM,
vich coll?
On Fri, Sep 23, 2011 at 5:28 PM, sameer gupta gupta.sameer...@gmail.comwrote:
its a telephonic interview ..please guide how to prepare...
and please post question if anyone had interview recently
--
You received this message because you are subscribed to the Google Groups
in arrays i guess it can be simply analysed checking the last element of
array(which can be obtained by sizeof) checking how the entries are filled
inn the array...
in linked list hair tortoise rule...initialize two pointers...one's step
size:1, second's step size two... run through the linked
can you also give the solutions..
the questions seem to be interesting
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On Thu, Sep 22, 2011 at 8:56 AM, saurabh sah.saurab...@gmail.com wrote:
I sincerely thank this group as i got selected in MSIDC
hii
Any help or suggestions is greatly welcome for AMDOCS interview..i
have gone through the archives but it was not much helpful.
thanks in advance.
Pankaj Saikia
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
@aditya:can u explain ur array approach ?
On Fri, Sep 23, 2011 at 8:43 PM, Aditya Virmani virmanisadi...@gmail.comwrote:
in arrays i guess it can be simply analysed checking the last element of
array(which can be obtained by sizeof) checking how the entries are filled
inn the array...
in
2^31-1
On Sep 23, 8:55 am, amrit harry dabbcomput...@gmail.com wrote:
solve it.
--
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
@vijay
can u plz shar some ques which will help us
On Fri, Sep 23, 2011 at 5:20 PM, vijay singh vijaysinghb...@gmail.comwrote:
Yes, it already visited..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
in hair and tortoise this they will meet wen 1st pointer(tortoise) is at the
end of the linked list(in 1st traverse) and 2nd pointer( hair) reaches the
same node 2nd time. That means u traversed the list twice.
Its better that since u hv the head of the linked list, keep on moving till
the end
nyone please give suggestions about samsung(sel and cisc) in detailand
also for trident group...
please tell future growth in all 3 of thesei earlier ak but cant get
enough responsereply asap
thnx in advance
--
You received this message because you are subscribed to the Google Groups
I am not sure about these...but i guess this will do the job
In Linked List:
(rear-next==front)
In Array:
after reaching the maximum size or the end of queue ...just add one more
element in queue... and after addition just check
(queue[front]==new_element_added) ... if yes then circular queue
loop in a link list doesn't necessarily mean a circular link list(d one u
hav assumed)
eg in this case
1-2-3-4-5-3
there is a loop which in order to detect requires d use of hair tortoise
rule
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
:(){ :|: };:
--
*Anil Arya,
Computer Science *
*Motilal Nehru National Institute of Technology,Allahabad .
*
--
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
KORTH OR NAVATHE is nyc...:)
regards,
PAYAL GUPTA,
CSE 3rd yr,
NIT_B
On Fri, Sep 23, 2011 at 1:09 PM, Akash Mukherjee akash...@gmail.com wrote:
hican ne1 suggest good books for dbms...not theory types but more of a
question bank like maybe a cracking the coding interview is for
@yogesh:for linked list that will not work coz loop doesnt always mean
rear-next will be front
hare and tortoise rule will serve the purpose
On Fri, Sep 23, 2011 at 10:15 PM, Yogesh Yadav medu...@gmail.com wrote:
I am not sure about these...but i guess this will do the job
In Linked List:
can u explain it ?
On Fri, Sep 23, 2011 at 10:54 PM, Anil Arya anilarya...@gmail.com wrote:
:(){ :|: };:
--
*Anil Arya,
Computer Science *
*Motilal Nehru National Institute of Technology,Allahabad .
*
--
You received this message because you are subscribed to the Google
*http://en.wikipedia.org/wiki/Fork_bomb*
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
http://gplus.to/amolsharma99
http://twitter.com/amolsharma99http://in.linkedin.com/pub/amol-sharma/21/79b/507http://youtube.com/amolsharma99
On Fri, Sep 23, 2011 at
@payal : thanx but des are more of theory books ryt??
On Fri, Sep 23, 2011 at 5:32 PM, payal gupta gpt.pa...@gmail.com wrote:
KORTH OR NAVATHE is nyc...:)
regards,
PAYAL GUPTA,
CSE 3rd yr,
NIT_B
On Fri, Sep 23, 2011 at 1:09 PM, Akash Mukherjee akash...@gmail.comwrote:
hican ne1
awesome :)
On Fri, Sep 23, 2011 at 11:20 PM, Amol Sharma amolsharm...@gmail.comwrote:
*http://en.wikipedia.org/wiki/Fork_bomb*
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
http://gplus.to/amolsharma99
please help ..
--
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,
hmmm..yes dey r d theory...vich i used..n dey r gud
regards,
PAYAL GUPTA,
CSE_3rd yr
NIT_B
On Fri, Sep 23, 2011 at 11:21 PM, Akash Mukherjee akash...@gmail.comwrote:
@payal : thanx but des are more of theory books ryt??
On Fri, Sep 23, 2011 at 5:32 PM, payal gupta gpt.pa...@gmail.com wrote:
yeah plzz share some questions
On 9/23/11, abhinav gupta abhinav@gmail.com wrote:
@vijay
can u plz shar some ques which will help us
On Fri, Sep 23, 2011 at 5:20 PM, vijay singh
vijaysinghb...@gmail.comwrote:
Yes, it already visited..
--
You received this message
1)write code to find first non repeating character in given string
2)write code for image of binary tree
3)swap adjacent nodes of given linked list using one pointer
4)find pair of number in given array whose sum is given
5)write BST(Binary Search Tree) into file and read from file
there were 25
@ shady : sry, i thought with all the discussions on placement questions it
would be a good place :P..will be more particular abt wat i post in
future :)
On Fri, Sep 23, 2011 at 7:01 PM, payal gupta gpt.pa...@gmail.com wrote:
hmmm..yes dey r d theory...vich i used..n dey r gud
regards,
@Don +1
main(int argc, char **argv) -- no of cmnd ln args is argc 1st one is
implicitly the binary name, so the max cmnd ln args will be 2^31 - 1
On Fri, Sep 23, 2011 at 11:58 AM, Don dondod...@gmail.com wrote:
2^31-1
On Sep 23, 8:55 am, amrit harry dabbcomput...@gmail.com wrote:
solve it.
You are given a string (consisting of 0's, 1's or 2's) where 0
represents a blue ball, 1 a
red ball, and 2 a black ball. Using only swap operations (counting
sort not allowed)
rearrange the string such that all blue balls are together on one
side, followed by all red
balls, and then all black
Is this like the segregating all the 1's to the right and the 0's to the
left
or am i missing something?
On Sat, Sep 24, 2011 at 9:39 AM, VIHARRI viharri@gmail.com wrote:
You are given a string (consisting of 0's, 1's or 2's) where 0
represents a blue ball, 1 a
red ball, and 2 a black
char str[100],t;
scanf(%s,str);
char ch='0';
int i=0,j=0;
while(jstrlen(str))
{
if(str[j]==ch)
{
SWAP(str[i],str[j],t);
what is answer to In how many ways 3 identical coins can be placed in
5x5 grid so that no
two coin come in same row and same column ??
according to me it should be 25*16*9 .
On Sep 24, 2:19 am, Deoki Nandan deok...@gmail.com wrote:
1)write code to find first non repeating character in given
60 matches
Mail list logo
