Re: [algogeeks] help with o/p why 0 comes???

2013-03-04 Thread Shubham Sandeep
to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out. -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. -- You

[algogeeks] separate coins into heaps of similar weights using balance in minimum comparisons

2013-03-01 Thread Shubham Sandeep
There are 8 coins in a bag . 3 coin weights x kg 3 coins weights y kg 2 coins weights z kg 2 coins weights w kg You have to separate them into separate heaps according to their weights in minimum comparisons using weighing balance. -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. -- You

Re: [algogeeks] Re: separate coins into heaps of similar weights using balance in minimum comparisons

2013-03-01 Thread Shubham Sandeep
2 coins weights z kg 2 coins weights w kg You have to separate them into separate heaps according to their weights in minimum comparisons using weighing balance. -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. -- You received this message because you are subscribed to the Google

[algogeeks] help with o/p why 0 comes???

2013-02-28 Thread Shubham Sandeep
code snippet: *int main() { printf (%d\n,(float)((int)(3.5/2))); return 0; }* -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from

Re: [algogeeks] help with o/p why 0 comes???

2013-02-28 Thread Shubham Sandeep
totally different format. If you have -Wall turned on, you should see a warning. Yanan Cao On Thu, Feb 28, 2013 at 1:41 PM, Shubham Sandeep s.shubhamsand...@gmail.com wrote: code snippet: *int main() { printf (%d\n,(float)((int)(3.5/2))); return 0; }* -- Regards, SHUBHAM SANDEEP

Re: [algogeeks] how does this code achieve SIGSEGV

2012-12-22 Thread Shubham Sandeep
...@gmail.comwrote: You are initialising random memory address with 0, which OS doesn't allow. On 12/17/12, Shubham Sandeep s.shubhamsand...@gmail.com wrote: how does this code achieve SIGSEGV code: *p;main(){*p=0;} -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD

[algogeeks] how does this code achieve SIGSEGV

2012-12-17 Thread Shubham Sandeep
how does this code achieve SIGSEGV code: *p;main(){*p=0;} -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. --

Re: [algogeeks] Re: adobe apti question

2012-12-17 Thread Shubham Sandeep
but not both Ans. (e) E option should be or 113 am i ryt??? A- b or c. if A-Bthen B-fg and Delse if A-C ,then c-eh and c-d am i ryt -- -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. --

Re: [algogeeks] Re: adobe apti question

2012-12-16 Thread Shubham Sandeep
but not both Ans. (e) E option should be or 113 am i ryt??? A- b or c. if A-Bthen B-fg and Delse if A-C ,then c-eh and c-d am i ryt -- -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. --

Re: [algogeeks] Re: Amazon interview Question

2012-12-16 Thread Shubham Sandeep
://nicolas-lara.blogspot.in/2009/01/permutations.html On Friday, December 14, 2012 11:56:16 AM UTC+5:30, tapan rathi wrote: For a given number, find the next greatest number which is just greater than previous one and made up of same digits. -- -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. --

[algogeeks] plz explain output y it is 1212

2012-08-17 Thread Shubham Sandeep
#includestdio.h main() { printf ( \%\d\ , 12 ) ; printf ( \%\ d\ , 12 ) ; } -- Regards, SHUBHAM SANDEEP IT 3rd yr. NIT ALD. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email

[algogeeks] Explain the output of this code:

2012-06-16 Thread Shubham Sandeep
#includestdio.h main() { int a[] = {0,1,2,3,4}; int *p[] = {a,a+1,a+2,a+3,a+4}; int **pp= p; printf(%d, %d, %d , *pp-a, pp-p, **pp); pp++; pp++;; ++pp; *++pp; printf(%d, %d, %d , pp-p, *pp-a, **pp); } output:0 ,0 ,0 ,4 ,4 ,4 -- You received this message

Re: [algogeeks] Microsoft Interview Question

2012-06-15 Thread Shubham Sandeep
@guneesh your code fails to keep order b/w 3 and 4 in the above example On Fri, Jun 15, 2012 at 2:40 PM, Guneesh Paul Singh gunees...@gmail.comwrote: void change(int a[],int n) { int i,j; i=0; j=1; while(injn) { if(ji) j=i+1; else

Re: [algogeeks] Directi Question

2012-06-15 Thread Shubham Sandeep
wat constraints does dis bring in the question... Also the books are arranged in a certain order and this order must never be changed. does this imply --- a student gets only consecutivly numbered book if not then sort the array B in decreasing order in Onlogn take another array S of k