Re: [algogeeks] IVY comptech????
someone please reply -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] citrix question
* Which of the following restricts a process to the memory allocated to it* * *a. stack pointers b. memory allocation hardware c. kernel d. none of these what's the answer of this question -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] IVY comptech????
@Wasif Yes Now this post is Irrelevant to Algogeeks. @Others Discuss about companies and interview Questions at new formed group Interview Street http://groups.google.com/group/interview-street?hl=en else you will be banned without any warnings On Sat, Oct 8, 2011 at 11:31 AM, raj kumar megamonste...@gmail.com wrote: someone please reply -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: explain the output please.....
*yeah..i was wrong as i didn't notice (-) sign .. *Thanking you *With regards- Raghav garg Contact no. 9013201944 www.facebook.com/rock.raghavag B. tech (IT), 5th sem University School Of Information Technology Guru Govind Singh Indraprastha University Delhi* On Sat, Oct 8, 2011 at 8:42 AM, rahul sharma rahul23111...@gmail.comwrote: o/p : fail 1 between c and u they will be in range so stored as it is but i is -16 converted to 2 complement n become -32 thats y On Sat, Oct 8, 2011 at 2:02 AM, Rahul Tiwari rahultiwari6...@gmail.comwrote: o/p - fail1 pass2 xplaination - as char range = (-127 to +127) so char c=-64 is ok so (ci) condition z not true ..so else part got executed . but u is unsigned so its actual value z , u = some very high + no. so iu cond is true -- so the final o/p --- fail1 pass2 if u want to verify then put this sentence in ur code then run : printf(%u\n,u); u got ur ans ... On Oct 8, 1:11 am, Raghav Garg rock.ragha...@gmail.com wrote: i have run the program in turbo c and getting same o/p as i wrote earlier.. which compiler you are using? On 10/8/11, gaurav yadav gauravyadav1...@gmail.com wrote: @raghav garg...run the code and see the output,the output comes fail1pass2 -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- Thanking you *With regards- Raghav garg Contact no. 9013201944www.facebook.com/rock.raghavag B. tech (IT), 5th sem University School Of Information Technology Guru Govind Singh Indraprastha University Delhi* -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] citrix question
Kernel. On 08-Oct-2011 11:33 AM, raj kumar megamonste...@gmail.com wrote: * Which of the following restricts a process to the memory allocated to it * * *a. stack pointers b. memory allocation hardware c. kernel d. none of these what's the answer of this question -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] citrix question
Plz put more question that has beem asked in citrix. On 08-Oct-2011 11:33 AM, raj kumar megamonste...@gmail.com wrote: * Which of the following restricts a process to the memory allocated to it * * *a. stack pointers b. memory allocation hardware c. kernel d. none of these what's the answer of this question -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Database Classes
Hi friends, Sorry for this off topic, but I found that it would be interesting for us that now we have online classes of Databases from Stannford.db-class.org -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/zpcbKJ1elvMJ. 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Basic Algorithm
A string of characters are given. Find the highest occurrence of a character and display that character. E.g Input: AEGBCNAVNEETGUPTAEDAGPE Output: E. Please give the efficient algorithm w.r.t both space and time.. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Basic Algorithm
1.hashing performance o(n) space o(n) keep incrementing the count..by hashing the each character 2.sort the input O(nlogn) check for succesive occurence of the character..the most occured wud b the ans. 3.Assume the array if of int type..Let A be at index 0,B at index 1..and so on. now start from index=0 to end arr[arr[index]%26]+=26 //that is..keep on incrementing the value by 26 at index 0 if it is A% is used because..the value can be greater then 26. now for index upto 25 check the maximum among arr[index]/26. performance O(n) no additional space...assumes character are from a-z and array greater than 26 On Sat, Oct 8, 2011 at 3:41 PM, ManishMCS manishdaw...@gmail.com wrote: A string of characters are given. Find the highest occurrence of a character and display that character. E.g Input: AEGBCNAVNEETGUPTAEDAGPE Output: E. Please give the efficient algorithm w.r.t both space and time.. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- *Dheeraj Sharma* -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks]
when i am running this on dev c it is printing times but on running in linux
it is not printing times plz any1 xplain me y is it so
#includestdio.h
main()
{
char outline[50];
char one[7],two[7],four[7],five[7];
int three;
sprintf(outline,this is %d tim %s \n,10,charlie);
printf(%s,outline);
sscanf(outline,%s %s %d %s %s,one,two,three,four,five);
printf(%s\n,one);
printf(%s\n,two);
printf(%d\n,three);
printf(%s\n,four);
printf(%s\n,five);
}
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks]
1. don't use dev c
2. search archives
3. after doing 2 you will say it is not there,
therefore solution by sunny -
char five[7] - string of length 7
charlie - 7 length string
declare it as char[8] u will get expected output
On Sat, Oct 8, 2011 at 4:14 PM, SHIVAM AGRAWAL shivi...@gmail.com wrote:
when i am running this on dev c it is printing times but on running in
linux it is not printing times plz any1 xplain me y is it so
#includestdio.h
main()
{
char outline[50];
char one[7],two[7],four[7],five[7];
int three;
sprintf(outline,this is %d tim %s \n,10,charlie);
printf(%s,outline);
sscanf(outline,%s %s %d %s %s,one,two,three,four,five);
printf(%s\n,one);
printf(%s\n,two);
printf(%d\n,three);
printf(%s\n,four);
printf(%s\n,five);
}
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks]
k got it thnx a lot.
On Sat, Oct 8, 2011 at 4:35 PM, shady sinv...@gmail.com wrote:
1. don't use dev c
2. search archives
3. after doing 2 you will say it is not there,
therefore solution by sunny -
char five[7] - string of length 7
charlie - 7 length string
declare it as char[8] u will get expected output
On Sat, Oct 8, 2011 at 4:14 PM, SHIVAM AGRAWAL shivi...@gmail.com wrote:
when i am running this on dev c it is printing times but on running in
linux it is not printing times plz any1 xplain me y is it so
#includestdio.h
main()
{
char outline[50];
char one[7],two[7],four[7],five[7];
int three;
sprintf(outline,this is %d tim %s \n,10,charlie);
printf(%s,outline);
sscanf(outline,%s %s %d %s %s,one,two,three,four,five);
printf(%s\n,one);
printf(%s\n,two);
printf(%d\n,three);
printf(%s\n,four);
printf(%s\n,five);
}
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Basic Algorithm
I wonder why my name is there in the example string used :) On Oct 8, 3:11 pm, ManishMCS manishdaw...@gmail.com wrote: A string of characters are given. Find the highest occurrence of a character and display that character. E.g Input: AEGBCNAVNEETGUPTAEDAGPE Output: E. Please give the efficient algorithm w.r.t both space and time.. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] BT Questions
1) how do u debug the code such tht u can know the compile time error?? 2) how do u judge/know exception going to arise ?? How we decide and when?? -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Database Classes
Thanks A lot for sharing!! On Sat, Oct 8, 2011 at 2:03 PM, Rahul Verma rahulverma@gmail.comwrote: Hi friends, Sorry for this off topic, but I found that it would be interesting for us that now we have online classes of Databases from Stannford. db-class.org -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/zpcbKJ1elvMJ. 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Basic Algorithm
:) On Sat, Oct 8, 2011 at 6:41 AM, Navneet navneetn...@gmail.com wrote: I wonder why my name is there in the example string used :) On Oct 8, 3:11 pm, ManishMCS manishdaw...@gmail.com wrote: A string of characters are given. Find the highest occurrence of a character and display that character. E.g Input: AEGBCNAVNEETGUPTAEDAGPE Output: E. Please give the efficient algorithm w.r.t both space and time.. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] SUGGESTIOn TO ALGo GEEKS
I have a suggestion to made...as a new group interview-street is there..but still a lot more info is available here in algogeeks only..so cant the owner of group move all the info about all the companies from algogeeks to interview-street.like pattern n ctc n etc..so that if somebody try to find then he/she cnt find and has to goto interview-street..this will filters the algogeeks from non algo problems and laso make interview-street to grow fast...wat say guys -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] SUGGESTIOn TO ALGo GEEKS
ya, how to do it ? how to move all discussions from one group to another if you know the procedure then reply. :D On Sat, Oct 8, 2011 at 10:41 PM, rahul sharma rahul23111...@gmail.comwrote: I have a suggestion to made...as a new group interview-street is there..but still a lot more info is available here in algogeeks only..so cant the owner of group move all the info about all the companies from algogeeks to interview-street.like pattern n ctc n etc..so that if somebody try to find then he/she cnt find and has to goto interview-street..this will filters the algogeeks from non algo problems and laso make interview-street to grow fast...wat say guys -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] SUGGESTIOn TO ALGo GEEKS
no..i dnt knw the procedure..actually i was searching about some companies..i have to post my query on interview-street..but look for archieve in algogeeks..so by my personal experience i thought its gud to have this all info in one group..procedure which i think is that the intersted member of algogeeks takes the respnsibility..like one person should take one company responsibility..and that person search for that companies info in algo geeks archieve and by extarcting the best 2-3 posts from algogeeks and then putting them on street-interview..(linke pateern,ctc,question paper)..No one should be given any work..@shady.u as owner post query that if sumone like to do so coz alone u is not possible to do..if more peaple take part its a work of 15 min..there is a chance that 2 or more peaple post about same company but it can be handled further coz our aim is to clean algogeeks..and grow iterview street...hope it helps... On Sat, Oct 8, 2011 at 11:06 PM, shady sinv...@gmail.com wrote: ya, how to do it ? how to move all discussions from one group to another if you know the procedure then reply. :D On Sat, Oct 8, 2011 at 10:41 PM, rahul sharma rahul23111...@gmail.comwrote: I have a suggestion to made...as a new group interview-street is there..but still a lot more info is available here in algogeeks only..so cant the owner of group move all the info about all the companies from algogeeks to interview-street.like pattern n ctc n etc..so that if somebody try to find then he/she cnt find and has to goto interview-street..this will filters the algogeeks from non algo problems and laso make interview-street to grow fast...wat say guys -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] c output
*explain the o/p...if i/p are 100 200 300
int main()
{
int a=1,b=2,c=3;
scanf(%d %*d %d,a,b,c);
printf(%d %d %d,a,b,c);
return(0);
}
*Thanking you
*With regards-
Raghav garg
Contact no. 9013201944
www.facebook.com/rock.raghavag
B. tech (IT), 5th sem
University School Of Information Technology
Guru Govind Singh Indraprastha University
Delhi*
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] SUGGESTIOn TO ALGo GEEKS
that is 200% true... but the thing is that there are more than 8000 people in algogeeks, and only those are active who either love learning new things or those who want to get high paid job in some companies. Once they get jobs they stop posting and become mute to query of others. I suggested people to add questions corresponding to each company in a google doc and then append it later on but it didnt happen. I think you can subscribe to both the groups. In Interview-Street post whatever you want in relation to companies and stuff :) . In algogeeks you can only discuss questions on algorithms and best way to solve problems. Thanks. On Sun, Oct 9, 2011 at 12:02 AM, rahul sharma rahul23111...@gmail.comwrote: no..i dnt knw the procedure..actually i was searching about some companies..i have to post my query on interview-street..but look for archieve in algogeeks..so by my personal experience i thought its gud to have this all info in one group..procedure which i think is that the intersted member of algogeeks takes the respnsibility..like one person should take one company responsibility..and that person search for that companies info in algo geeks archieve and by extarcting the best 2-3 posts from algogeeks and then putting them on street-interview..(linke pateern,ctc,question paper)..No one should be given any work..@shady.u as owner post query that if sumone like to do so coz alone u is not possible to do..if more peaple take part its a work of 15 min..there is a chance that 2 or more peaple post about same company but it can be handled further coz our aim is to clean algogeeks..and grow iterview street...hope it helps... On Sat, Oct 8, 2011 at 11:06 PM, shady sinv...@gmail.com wrote: ya, how to do it ? how to move all discussions from one group to another if you know the procedure then reply. :D On Sat, Oct 8, 2011 at 10:41 PM, rahul sharma rahul23111...@gmail.comwrote: I have a suggestion to made...as a new group interview-street is there..but still a lot more info is available here in algogeeks only..so cant the owner of group move all the info about all the companies from algogeeks to interview-street.like pattern n ctc n etc..so that if somebody try to find then he/she cnt find and has to goto interview-street..this will filters the algogeeks from non algo problems and laso make interview-street to grow fast...wat say guys -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Database Classes
thnxx...4 sharing..:):) regards, PAYAL GUPTA, CSE_3rd yr NIT_B On Sat, Oct 8, 2011 at 7:47 PM, monty 1987 1986mo...@gmail.com wrote: Thanks A lot for sharing!! On Sat, Oct 8, 2011 at 2:03 PM, Rahul Verma rahulverma@gmail.comwrote: Hi friends, Sorry for this off topic, but I found that it would be interesting for us that now we have online classes of Databases from Stannford. db-class.org -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/zpcbKJ1elvMJ. 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Database Classes
You are welcome. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/WJz0FGP5wUgJ. 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] c output
as expected value 100 goes to a,since %*d is variable field width specifier
so the input 200 goes for that,and the remaining input 300 goes to b
value of c is not change
so the output will be:
100 300 3
On Sun, Oct 9, 2011 at 12:22 AM, Raghav Garg rock.ragha...@gmail.comwrote:
*explain the o/p...if i/p are 100 200 300
int main()
{
int a=1,b=2,c=3;
scanf(%d %*d %d,a,b,c);
printf(%d %d %d,a,b,c);
return(0);
}
*Thanking you
*With regards-
Raghav garg
Contact no. 9013201944
www.facebook.com/rock.raghavag
B. tech (IT), 5th sem
University School Of Information Technology
Guru Govind Singh Indraprastha University
Delhi*
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] c output
This is what you use if you want *scanf()* to eat some data but you don't
want to store it anywhere; you don't give *scanf()* an argument for this
conversion
On Sun, Oct 9, 2011 at 1:32 AM, shiva@Algo shiv.jays...@gmail.com wrote:
as expected value 100 goes to a,since %*d is variable field width specifier
so the input 200 goes for that,and the remaining input 300 goes to b
value of c is not change
so the output will be:
100 300 3
On Sun, Oct 9, 2011 at 12:22 AM, Raghav Garg rock.ragha...@gmail.comwrote:
*explain the o/p...if i/p are 100 200 300
int main()
{
int a=1,b=2,c=3;
scanf(%d %*d %d,a,b,c);
printf(%d %d %d,a,b,c);
return(0);
}
*Thanking you
*With regards-
Raghav garg
Contact no. 9013201944
www.facebook.com/rock.raghavag
B. tech (IT), 5th sem
University School Of Information Technology
Guru Govind Singh Indraprastha University
Delhi*
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: MS test cases type Questions
k... thanx...your info vud be of great help for me in future.. regards, PAYAL GUPTA, CSE 3RD YR NIT_B On Wed, Sep 14, 2011 at 11:38 PM, KK kunalkapadi...@gmail.com wrote: U must mention all the boundary cases, very large input cases, -ve nos and must throw appropriate exception while coding during interviews... Questions are not too hard in MS... just they dont want buggy code... even if u allocate memory.. u should take an if condition i.e. if (p ! = NULL)...and avoid such other silly mistakes... -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Can Any1 provide a proper implementation of a Hashtable(Seperation Chaining) in C,C++
#includeiostream
#includevector
#includelist
#define TR(a,it)for(typeof((a).begin()) it = (a).begin(); it !=
(a).end(); ++it)
using namespace std;
void Insert(int key, int m, vector listint v);
listint::iterator Search(int key, int m, vector listint v);
void Delete(int key, int m, vector listint v);
int main()
{
int m,choice,key;
vector listint v;
cout Enter the no of slots endl;
cin m;
v.resize(m);
while(1)
{
cout 1. Insert\n2. Search \n3. Delete \n4. Exit\n;
cin choice;
switch(choice)
{
case 1:
cout Enter the key\n;
cin key;
Insert(key, m, v);
break;
case 2:
cout Enter the key\n;
cin key;
Search(key, m, v);
break;
case 3:
cout Enter the key\n;
cin key;
Delete(key, m, v);
break;
case 4:
exit(0);
}
}
}
int h(int key, int m)
{
return key % m;
}
void Insert(int key, int m, vector listint v)
{
int slot = h(key,m);
if(Search(key,m,v) == NULL)
{
cout Inserting...\n;
v[slot].push_back(key);
cout Insertion Completed!!\n;
}
}
listint::iterator Search(int key, int m, vector listint v)
{
int slot = h(key, m);
cout Searching...;
TR(v[slot], it)
{
if(*it == key)
{
cout Key found!!\n;
return it;
}
}
cout key not found!!\n;
return NULL; //we can use like this also:
(listint iterator::i)NULL
}
void Delete(int key, int m, vector listint v)
{
int slot = h(key, m);
listint::iterator i;
i = Search(key, m, v);
if(i != NULL)
{
v[slot].erase(i);
cout Deletion Completed!!\n;
}
}
This is not a tested code... it may contain bugs!!
--
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 group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Attention All Members
Now All of the messages are being Moderated and will be posted on the group only if they are found relevant, any irrelevant post be simply discarded without any notification till percentage of irrelevant posts reduces by a significant amount. if someone is found posting too many irrelevant post, he/she will be banned. Irrelevant Posts 1. Any Company Interview Question (Except Google, Facebook only) 2. Any Code Debugging Post (of type Plz Debug my code You should be able to do it yourself) 3. any kind of C/C++ output question. 4. Any Company related Queries 5. Any Book Requests 6. Any Post having No subjects. (if Subject are there they must be related and Give idea about the post. and again Don't post the complete Question in the subject. it should be posted in the body of the message) + Any OS compiler or other topics unless it requires some good Quality discussion. All the above types of post (Except 6) are now part of new group Interview Street (search Archives for the link). -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Attention All Members
+1 On Sun, Oct 9, 2011 at 2:07 AM, Sunny sunny816.i...@gmail.com wrote: Now All of the messages are being Moderated and will be posted on the group only if they are found relevant, any irrelevant post be simply discarded without any notification till percentage of irrelevant posts reduces by a significant amount. if someone is found posting too many irrelevant post, he/she will be banned. Irrelevant Posts 1. Any Company Interview Question (Except Google, Facebook only) 2. Any Code Debugging Post (of type Plz Debug my code You should be able to do it yourself) 3. any kind of C/C++ output question. 4. Any Company related Queries 5. Any Book Requests 6. Any Post having No subjects. (if Subject are there they must be related and Give idea about the post. and again Don't post the complete Question in the subject. it should be posted in the body of the message) + Any OS compiler or other topics unless it requires some good Quality discussion. All the above types of post (Except 6) are now part of new group Interview Street (search Archives for the link). -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Efficient Algo for Merging 2 Binary Search Trees
Hi , Can anyone think of any better for doing this other than converting into List and then converting back again to BST .. Regards -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Efficient Algo for Merging 2 Binary Search Trees
Inorder traversal of one tree insert into another? On Sat, Oct 8, 2011 at 4:33 PM, Ankur Garg ankurga...@gmail.com wrote: Hi , Can anyone think of any better for doing this other than converting into List and then converting back again to BST .. Regards -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Deletion in AVL tree
Can anyone suggest a pseudocode handling rotations in an AVL tree for deleting a node I couldnt find one in the internet and was unable to derive a proper logic which cud be transformed into code :( -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Efficient Algo for Merging 2 Binary Search Trees
Actually, it doesn't have to be inorder. The naive approach is to traverse through the smaller tree (using any traversal in|pre|post|level order) and insert each node into the bigger tree. The order of this would be n2logn1 A better approach is to try and fit as much of the smaller bst into the larger bst. To explain, imagine the second (and smaller) bst can go and fit snugly as a leaf of the first bst, then you just need to do a logn1 traversal to find this location to insert the smaller bst into the larger bst. However you might not always have a spot in the first bst for the second bst to go as a whole. Here you break up the second tree into three pieces, root node, left subtree and right subtree. You insert the root node into BST1 and recursively call the merge on BST1 LeftSubTreeOfBST2 AND BST1 and RightSubTreeOfBST2. I think the worst case of this is not going to be much better than the naive approach but asymptotically this one should kick ass. ( To ensure that an adversary cannot make it perform badly, we can decide which BST to use as bst1 randomly.) Can anyone try and deduce the actual order of this algorithm (if it works) merge (bst1, bst2): if (bst2 is null) return bst1 if (bst1 is null) return bst2 if (bst2.max_element bst1.val) bst1.left = merge (bst1.left, bst2) else if (bst2.min_element bst1.val) bst1.right = merge (bst1.right, bst2) else // it means bst2 needs to be split up right away insertIntoBst(bst1, bst2.val) bst1 = merge (bst1, bst2.left) bst1 = merge (bst1, bst2.right) On Sun, Oct 9, 2011 at 3:38 AM, Vandana Bachani vandana@gmail.comwrote: Inorder traversal of one tree insert into another? On Sat, Oct 8, 2011 at 4:33 PM, Ankur Garg ankurga...@gmail.com wrote: Hi , Can anyone think of any better for doing this other than converting into List and then converting back again to BST .. Regards -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Efficient Algo for Merging 2 Binary Search Trees
Recursively store parent and child pointers of the to-be-inserted tree using post-order traversal,and when processing each node during traversal reassign pointers to the other tree using BST insertion. Inorder may not work due to distortion of parent pointers? On Sun, Oct 9, 2011 at 3:38 AM, Vandana Bachani vandana@gmail.comwrote: Inorder traversal of one tree insert into another? On Sat, Oct 8, 2011 at 4:33 PM, Ankur Garg ankurga...@gmail.com wrote: Hi , Can anyone think of any better for doing this other than converting into List and then converting back again to BST .. Regards -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Attention All Members
This will reduce the no. of people coming to post on this group Sanju :) On Sat, Oct 8, 2011 at 2:33 PM, Ankur Garg ankurga...@gmail.com wrote: +1 On Sun, Oct 9, 2011 at 2:07 AM, Sunny sunny816.i...@gmail.com wrote: Now All of the messages are being Moderated and will be posted on the group only if they are found relevant, any irrelevant post be simply discarded without any notification till percentage of irrelevant posts reduces by a significant amount. if someone is found posting too many irrelevant post, he/she will be banned. Irrelevant Posts 1. Any Company Interview Question (Except Google, Facebook only) 2. Any Code Debugging Post (of type Plz Debug my code You should be able to do it yourself) 3. any kind of C/C++ output question. 4. Any Company related Queries 5. Any Book Requests 6. Any Post having No subjects. (if Subject are there they must be related and Give idea about the post. and again Don't post the complete Question in the subject. it should be posted in the body of the message) + Any OS compiler or other topics unless it requires some good Quality discussion. All the above types of post (Except 6) are now part of new group Interview Street (search Archives for the link). -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Attention All Members
well new group is already there so people can post job related questions, book requests there... those who are genuinely interested in learning algorithms will be seen in this group. :D On Sun, Oct 9, 2011 at 10:57 AM, Sanjay Rajpal srn...@gmail.com wrote: This will reduce the no. of people coming to post on this group Sanju :) On Sat, Oct 8, 2011 at 2:33 PM, Ankur Garg ankurga...@gmail.com wrote: +1 On Sun, Oct 9, 2011 at 2:07 AM, Sunny sunny816.i...@gmail.com wrote: Now All of the messages are being Moderated and will be posted on the group only if they are found relevant, any irrelevant post be simply discarded without any notification till percentage of irrelevant posts reduces by a significant amount. if someone is found posting too many irrelevant post, he/she will be banned. Irrelevant Posts 1. Any Company Interview Question (Except Google, Facebook only) 2. Any Code Debugging Post (of type Plz Debug my code You should be able to do it yourself) 3. any kind of C/C++ output question. 4. Any Company related Queries 5. Any Book Requests 6. Any Post having No subjects. (if Subject are there they must be related and Give idea about the post. and again Don't post the complete Question in the subject. it should be posted in the body of the message) + Any OS compiler or other topics unless it requires some good Quality discussion. All the above types of post (Except 6) are now part of new group Interview Street (search Archives for the link). -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en. -- 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 group at http://groups.google.com/group/algogeeks?hl=en.
