Re: [algogeeks] Microsoft Internship
yes he is right.we need to use an array of size 128 as a hash table :) On Wed, Aug 3, 2011 at 10:58 PM, Anurag atri wrote: > Exactly , easy questions will be asked , make sure you catch given hints :) > > > On Wed, Aug 3, 2011 at 9:01 PM, coder coder > wrote: > >> the interviewers are asking easy questions like spiral finding, loop in >> the list, common ancestor etc.. >> >> -- >> 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. >> > > > > -- > Regards > Anurag Atri > III year > Computer Engineering > Delhi College Of Engineering > > -- > 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] Microsoft Internship
Exactly , easy questions will be asked , make sure you catch given hints :) On Wed, Aug 3, 2011 at 9:01 PM, coder coder wrote: > the interviewers are asking easy questions like spiral finding, loop in the > list, common ancestor etc.. > > -- > 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. > -- Regards Anurag Atri III year Computer Engineering Delhi College Of Engineering -- 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] Microsoft Internship
the interviewers are asking easy questions like spiral finding, loop in the list, common ancestor etc.. -- 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] Microsoft Internship
We dont need to worry if its repeated three times or hundred times.We stop bothering once we are confirmed its repeated twice I have posted my working code in a previous post on the same question.Please read my code and let me know wats the problem, On Tue, Aug 2, 2011 at 10:58 PM, muthu raj wrote: > @saurabh : i got the complete idea. Can u explain how will bit > represenation be if a character is repeated 3 times? its set as 1 ryt? > *Muthuraj > > IV th Year , ISE > PESIT , Bangalore > * > > > > > On Tue, Aug 2, 2011 at 10:27 PM, saurabh singh wrote: > >> my hash table was my bitsread againI have posted this soln. >> earlier post too,,,posting again.. >> 1.scan string. >> let the ascii value of each char visited be i >> if ith bit set >>then check visited region(last 4 ints) for ith bit >>if ith bit set do nothing >>else set it >> 2.if not set set the ith bit in the count region(first four ints) set it. >> 3.Now you done with scanning scan again checking the visited region for >> the ith bit.If set continue. >> else return the char, >> 4.If out of loop return -1 >> >> Hope I am clear nowIf I am still not clear sorry I can't be more clear >> than this.. >> On Tue, Aug 2, 2011 at 7:31 PM, muthu raj wrote: >> >>> 1) subjective question: >>> >>> To find the first repetitive character how can you use bits because you >>> cannot keep track of first repeated character and also if a character is >>> present more than twice for ex thrice its mask shows 1 indicating it has >>> occured once. So please tell how to implement in O(1) space. If we use Hash >>> table we can do it in O(n) space and time. >>> >>> >>> >>> *Muthuraj R >>> IV th Year , ISE >>> PESIT , Bangalore* >>> >>> >>> >>> On Tue, Aug 2, 2011 at 7:24 PM, saurabh singh wrote: >>> and optimize as much as you can...even if the interviewer says that he is satisfied I was asked Q.1 mentioned above.I first used bitset.He asked me if I could do in pure c without using *any other function.*While I was working on my code he said he will be ok if I use an int array of 256.I kept telling him I could do better,he need not worry.I ended up with just 8 int variables(and an internship with MS) :)* * On Tue, Aug 2, 2011 at 6:55 PM, sourabh jakhar >>> > wrote: > abe dce se kitne leke gaye ms final year se aur package kya offer kiya > > > On Tue, Aug 2, 2011 at 6:21 PM, Anurag atri > wrote: > >> you have to be in formals for sure ! >> yes , people who clear the written will have 3 interviews . >> >> >> On Tue, Aug 2, 2011 at 2:15 PM, saurabh modi < >> saurabhmodi102...@gmail.com> wrote: >> >>> hey man,could you tell something abt the attire and all.? >>> we dont need to go in formals,right? >>> plus,koi interview and all hoga? >>> >>> -- >>> 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. >>> >> >> >> >> -- >> Regards >> Anurag Atri >> III year >> Computer Engineering >> Delhi College Of Engineering >> >> >> -- >> 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. >> > > > > -- > SOURABH JAKHAR,(CSE)(Final year) > ROOM NO 167 , > TILAK,HOSTEL > 'MNNIT ALLAHABAD > > The Law of Win says, "Let's not do it your way or my way; let's do it > the best way." > > -- > 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. > -- Saurabh Singh B.Tech (Computer Science) MNNIT 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 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 rece
Re: [algogeeks] Microsoft Internship
@saurabh : i got the complete idea. Can u explain how will bit represenation be if a character is repeated 3 times? its set as 1 ryt? *Muthuraj IV th Year , ISE PESIT , Bangalore* On Tue, Aug 2, 2011 at 10:27 PM, saurabh singh wrote: > my hash table was my bitsread againI have posted this soln. earlier > post too,,,posting again.. > 1.scan string. > let the ascii value of each char visited be i > if ith bit set >then check visited region(last 4 ints) for ith bit >if ith bit set do nothing >else set it > 2.if not set set the ith bit in the count region(first four ints) set it. > 3.Now you done with scanning scan again checking the visited region for the > ith bit.If set continue. > else return the char, > 4.If out of loop return -1 > > Hope I am clear nowIf I am still not clear sorry I can't be more clear > than this.. > On Tue, Aug 2, 2011 at 7:31 PM, muthu raj wrote: > >> 1) subjective question: >> >> To find the first repetitive character how can you use bits because you >> cannot keep track of first repeated character and also if a character is >> present more than twice for ex thrice its mask shows 1 indicating it has >> occured once. So please tell how to implement in O(1) space. If we use Hash >> table we can do it in O(n) space and time. >> >> >> >> *Muthuraj R >> IV th Year , ISE >> PESIT , Bangalore* >> >> >> >> On Tue, Aug 2, 2011 at 7:24 PM, saurabh singh wrote: >> >>> and optimize as much as you can...even if the interviewer says that he is >>> satisfied >>> I was asked Q.1 mentioned above.I first used bitset.He asked me if I >>> could do in pure c without using *any other function.*While I was >>> working on my code he said he will be ok if I use an int array of 256.I >>> kept telling him I could do better,he need not worry.I ended up with just 8 >>> int variables(and an internship with MS) :)* * >>> >>> >>> On Tue, Aug 2, 2011 at 6:55 PM, sourabh jakhar >>> wrote: >>> abe dce se kitne leke gaye ms final year se aur package kya offer kiya On Tue, Aug 2, 2011 at 6:21 PM, Anurag atri wrote: > you have to be in formals for sure ! > yes , people who clear the written will have 3 interviews . > > > On Tue, Aug 2, 2011 at 2:15 PM, saurabh modi < > saurabhmodi102...@gmail.com> wrote: > >> hey man,could you tell something abt the attire and all.? >> we dont need to go in formals,right? >> plus,koi interview and all hoga? >> >> -- >> 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. >> > > > > -- > Regards > Anurag Atri > III year > Computer Engineering > Delhi College Of Engineering > > > -- > 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. > -- SOURABH JAKHAR,(CSE)(Final year) ROOM NO 167 , TILAK,HOSTEL 'MNNIT ALLAHABAD The Law of Win says, "Let's not do it your way or my way; let's do it the best way." -- 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. >>> >>> >>> >>> -- >>> Saurabh Singh >>> B.Tech (Computer Science) >>> MNNIT 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 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. >> > > > > -- > Saurabh Singh > B.Tech (Computer Science) > MNNIT ALLAHABAD > > > -- > You received this message becau
Re: [algogeeks] Microsoft Internship
my hash table was my bitsread againI have posted this soln. earlier post too,,,posting again.. 1.scan string. let the ascii value of each char visited be i if ith bit set then check visited region(last 4 ints) for ith bit if ith bit set do nothing else set it 2.if not set set the ith bit in the count region(first four ints) set it. 3.Now you done with scanning scan again checking the visited region for the ith bit.If set continue. else return the char, 4.If out of loop return -1 Hope I am clear nowIf I am still not clear sorry I can't be more clear than this.. On Tue, Aug 2, 2011 at 7:31 PM, muthu raj wrote: > 1) subjective question: > > To find the first repetitive character how can you use bits because you > cannot keep track of first repeated character and also if a character is > present more than twice for ex thrice its mask shows 1 indicating it has > occured once. So please tell how to implement in O(1) space. If we use Hash > table we can do it in O(n) space and time. > > > > *Muthuraj R > IV th Year , ISE > PESIT , Bangalore* > > > > On Tue, Aug 2, 2011 at 7:24 PM, saurabh singh wrote: > >> and optimize as much as you can...even if the interviewer says that he is >> satisfied >> I was asked Q.1 mentioned above.I first used bitset.He asked me if I >> could do in pure c without using *any other function.*While I was working >> on my code he said he will be ok if I use an int array of 256.I kept >> telling him I could do better,he need not worry.I ended up with just 8 int >> variables(and an internship with MS) :)* * >> >> >> On Tue, Aug 2, 2011 at 6:55 PM, sourabh jakhar >> wrote: >> >>> abe dce se kitne leke gaye ms final year se aur package kya offer kiya >>> >>> >>> On Tue, Aug 2, 2011 at 6:21 PM, Anurag atri wrote: >>> you have to be in formals for sure ! yes , people who clear the written will have 3 interviews . On Tue, Aug 2, 2011 at 2:15 PM, saurabh modi < saurabhmodi102...@gmail.com> wrote: > hey man,could you tell something abt the attire and all.? > we dont need to go in formals,right? > plus,koi interview and all hoga? > > -- > 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. > -- Regards Anurag Atri III year Computer Engineering Delhi College Of Engineering -- 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. >>> >>> >>> >>> -- >>> SOURABH JAKHAR,(CSE)(Final year) >>> ROOM NO 167 , >>> TILAK,HOSTEL >>> 'MNNIT ALLAHABAD >>> >>> The Law of Win says, "Let's not do it your way or my way; let's do it >>> the best way." >>> >>> -- >>> 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. >>> >> >> >> >> -- >> Saurabh Singh >> B.Tech (Computer Science) >> MNNIT 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 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. > -- Saurabh Singh B.Tech (Computer Science) MNNIT 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 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] Microsoft Internship
1) subjective question: To find the first repetitive character how can you use bits because you cannot keep track of first repeated character and also if a character is present more than twice for ex thrice its mask shows 1 indicating it has occured once. So please tell how to implement in O(1) space. If we use Hash table we can do it in O(n) space and time. *Muthuraj R IV th Year , ISE PESIT , Bangalore* On Tue, Aug 2, 2011 at 7:24 PM, saurabh singh wrote: > and optimize as much as you can...even if the interviewer says that he is > satisfied > I was asked Q.1 mentioned above.I first used bitset.He asked me if I could > do in pure c without using *any other function.*While I was working on my > code he said he will be ok if I use an int array of 256.I kept telling him > I could do better,he need not worry.I ended up with just 8 int variables(and > an internship with MS) :)* * > > > On Tue, Aug 2, 2011 at 6:55 PM, sourabh jakhar wrote: > >> abe dce se kitne leke gaye ms final year se aur package kya offer kiya >> >> >> On Tue, Aug 2, 2011 at 6:21 PM, Anurag atri wrote: >> >>> you have to be in formals for sure ! >>> yes , people who clear the written will have 3 interviews . >>> >>> >>> On Tue, Aug 2, 2011 at 2:15 PM, saurabh modi < >>> saurabhmodi102...@gmail.com> wrote: >>> hey man,could you tell something abt the attire and all.? we dont need to go in formals,right? plus,koi interview and all hoga? -- 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. >>> >>> >>> >>> -- >>> Regards >>> Anurag Atri >>> III year >>> Computer Engineering >>> Delhi College Of Engineering >>> >>> >>> -- >>> 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. >>> >> >> >> >> -- >> SOURABH JAKHAR,(CSE)(Final year) >> ROOM NO 167 , >> TILAK,HOSTEL >> 'MNNIT ALLAHABAD >> >> The Law of Win says, "Let's not do it your way or my way; let's do it >> the best way." >> >> -- >> 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. >> > > > > -- > Saurabh Singh > B.Tech (Computer Science) > MNNIT 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 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] Microsoft Internship
Hi I want to know if I should be thorough C and C++ and Java. My kind of rusty with C now. I am brushing my C++ because they say MS prefers you code in C++ than Java. But C ? Cheers Supraja J On Tue, Aug 2, 2011 at 2:33 AM, Anu wrote: > Microsoft visited our campus today , an advice for everybody preparing > for it , make sure you know all the recently asked questions(posted on > algogeeks) , they repeat some questions . > > Written Round: > objective round , 30 minutes , 10 questions(easy) . > subjective round , 45 minutes , 2 questions (easy) > > The questions of subjective round were > 1.Find the first non repeating character in a string , do it in O(n) > time and O(1) space , use one bit per character for checking > repeatedness. > 2.Write test cases for find and replace function of notepad . > > The questions of objective round were: > 1.Some address calculation in array > 2.Input-Output > 3.A question involving classes , we were asked what a function was > doing ( very simple ) > 4.A question involving some set operations > 5.Find the percentage of occupancy in a disk ( this is the one that > was repeated ) > 6.A question involving the use of scanset in scanf . > 7.What gcc stands for ( yes , they actually asked it ) > 8.A function involving use of this statement (int)(x + 0.5) , again a > repeated question :) > > Thats all i remember :) > > Anurag Atri > Delhi College Of Engineering > > -- > 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. > > -- U -- 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] Microsoft Internship
@saurabh : then please explain the algorithm even of using 8 ints On Tue, Aug 2, 2011 at 7:24 PM, saurabh singh wrote: > and optimize as much as you can...even if the interviewer says that he is > satisfied > I was asked Q.1 mentioned above.I first used bitset.He asked me if I could > do in pure c without using *any other function.*While I was working on my > code he said he will be ok if I use an int array of 256.I kept telling him > I could do better,he need not worry.I ended up with just 8 int variables(and > an internship with MS) :)* * > > > On Tue, Aug 2, 2011 at 6:55 PM, sourabh jakhar wrote: > >> abe dce se kitne leke gaye ms final year se aur package kya offer kiya >> >> >> On Tue, Aug 2, 2011 at 6:21 PM, Anurag atri wrote: >> >>> you have to be in formals for sure ! >>> yes , people who clear the written will have 3 interviews . >>> >>> >>> On Tue, Aug 2, 2011 at 2:15 PM, saurabh modi < >>> saurabhmodi102...@gmail.com> wrote: >>> hey man,could you tell something abt the attire and all.? we dont need to go in formals,right? plus,koi interview and all hoga? -- 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. >>> >>> >>> >>> -- >>> Regards >>> Anurag Atri >>> III year >>> Computer Engineering >>> Delhi College Of Engineering >>> >>> >>> -- >>> 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. >>> >> >> >> >> -- >> SOURABH JAKHAR,(CSE)(Final year) >> ROOM NO 167 , >> TILAK,HOSTEL >> 'MNNIT ALLAHABAD >> >> The Law of Win says, "Let's not do it your way or my way; let's do it >> the best way." >> >> -- >> 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. >> > > > > -- > Saurabh Singh > B.Tech (Computer Science) > MNNIT 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 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. > -- best wishes!! Vaibhav -- 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] Microsoft Internship
and optimize as much as you can...even if the interviewer says that he is satisfied I was asked Q.1 mentioned above.I first used bitset.He asked me if I could do in pure c without using *any other function.*While I was working on my code he said he will be ok if I use an int array of 256.I kept telling him I could do better,he need not worry.I ended up with just 8 int variables(and an internship with MS) :)* * On Tue, Aug 2, 2011 at 6:55 PM, sourabh jakhar wrote: > abe dce se kitne leke gaye ms final year se aur package kya offer kiya > > > On Tue, Aug 2, 2011 at 6:21 PM, Anurag atri wrote: > >> you have to be in formals for sure ! >> yes , people who clear the written will have 3 interviews . >> >> >> On Tue, Aug 2, 2011 at 2:15 PM, saurabh modi > > wrote: >> >>> hey man,could you tell something abt the attire and all.? >>> we dont need to go in formals,right? >>> plus,koi interview and all hoga? >>> >>> -- >>> 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. >>> >> >> >> >> -- >> Regards >> Anurag Atri >> III year >> Computer Engineering >> Delhi College Of Engineering >> >> >> -- >> 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. >> > > > > -- > SOURABH JAKHAR,(CSE)(Final year) > ROOM NO 167 , > TILAK,HOSTEL > 'MNNIT ALLAHABAD > > The Law of Win says, "Let's not do it your way or my way; let's do it the > best way." > > -- > 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. > -- Saurabh Singh B.Tech (Computer Science) MNNIT 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 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] Microsoft Internship
abe dce se kitne leke gaye ms final year se aur package kya offer kiya On Tue, Aug 2, 2011 at 6:21 PM, Anurag atri wrote: > you have to be in formals for sure ! > yes , people who clear the written will have 3 interviews . > > > On Tue, Aug 2, 2011 at 2:15 PM, saurabh modi > wrote: > >> hey man,could you tell something abt the attire and all.? >> we dont need to go in formals,right? >> plus,koi interview and all hoga? >> >> -- >> 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. >> > > > > -- > Regards > Anurag Atri > III year > Computer Engineering > Delhi College Of Engineering > > > -- > 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. > -- SOURABH JAKHAR,(CSE)(Final year) ROOM NO 167 , TILAK,HOSTEL 'MNNIT ALLAHABAD The Law of Win says, "Let's not do it your way or my way; let's do it the best way." -- 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] Microsoft Internship
you have to be in formals for sure ! yes , people who clear the written will have 3 interviews . On Tue, Aug 2, 2011 at 2:15 PM, saurabh modi wrote: > hey man,could you tell something abt the attire and all.? > we dont need to go in formals,right? > plus,koi interview and all hoga? > > -- > 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. > -- Regards Anurag Atri III year Computer Engineering Delhi College Of Engineering -- 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] Microsoft Internship
hey man,could you tell something abt the attire and all.? we dont need to go in formals,right? plus,koi interview and all hoga? -- 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] Microsoft Internship
Microsoft visited our campus today , an advice for everybody preparing for it , make sure you know all the recently asked questions(posted on algogeeks) , they repeat some questions . Written Round: objective round , 30 minutes , 10 questions(easy) . subjective round , 45 minutes , 2 questions (easy) The questions of subjective round were 1.Find the first non repeating character in a string , do it in O(n) time and O(1) space , use one bit per character for checking repeatedness. 2.Write test cases for find and replace function of notepad . The questions of objective round were: 1.Some address calculation in array 2.Input-Output 3.A question involving classes , we were asked what a function was doing ( very simple ) 4.A question involving some set operations 5.Find the percentage of occupancy in a disk ( this is the one that was repeated ) 6.A question involving the use of scanset in scanf . 7.What gcc stands for ( yes , they actually asked it ) 8.A function involving use of this statement (int)(x + 0.5) , again a repeated question :) Thats all i remember :) Anurag Atri Delhi College Of Engineering -- 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.
