[algogeeks] MS-IT
hi!! MS-IT is visiting our college. could anyone plz help me in knowing what kind of questions(interview) they asked/asking. Thanks in advance. Ankit Arun NIT Durgapur -- 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/-/H09-9Q6HMUIJ. 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: SEEK advice very urgent
@ raj which clg r u from? I would say btr to choose its branch in Singapore. -- 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/-/eUlkIYwpzTgJ. 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: Suggestion
Ya sure... :) After posting it Igot even more confused... On Sat, Aug 27, 2011 at 9:33 AM, siddharth srivastava wrote: > > > On 27 August 2011 08:48, ankit arun wrote: > >> thanks everybody for so many suggestions... :) > > > > so let us know when you finish all those :P > > >> >> >> On Sat, Aug 27, 2011 at 6:40 AM, Rahul wrote: >> >>> If the seeker wants to do entire self study , then I would suggest CS >>> 106B Reader , it's in C ++ , BUT ideal for people who rely only on >>> internet. ALso that Data STructure USing C ,Book by Y. KAnitikar , I >>> never saw any math in any chapters for analysis of algorithms they >>> write >>> . lol. Google it as CS106B reader. >>> >>> On 8/26/11, sukran dhawan wrote: >>> > wat are u tying to say :P ? is that a good book or wat ? >>> > >>> > On Fri, Aug 26, 2011 at 7:55 PM, saurabh singh >>> wrote: >>> > >>> >> Yayashwant kanitekar and deepali srivastava are great books >>> >> >>> >> If you find all the mistakes that they have made you have learned >>> DS(and >>> >> coding style) quite well.:p >>> >> >>> >> On Fri, Aug 26, 2011 at 2:44 PM, Suraj Fale >>> wrote: >>> >> >>> >>> A book by 'Yashwant Kanetkar' >>> >>> >>> >>> >>> >>> On Fri, Aug 26, 2011 at 9:03 AM, Navneet >>> wrote: >>> >>> >>> >>>> Ankit, i would also like to mention Mark Allan Weiss book on Data >>> >>>> Structures. Available in both C and C++ (different books) >>> >>>> >>> >>>> On Aug 25, 3:59 pm, Abhishek wrote: >>> >>>> > for simplicity use, >>> >>>> > Data Structures Through C in Depth -S. K. Srivastava, Deepali >>> >>>> Srivastava >>> >>>> > >>> >>>> > all the topics are discussed in very simple manner. >>> >>>> >>> >>>> -- >>> >>>> 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 >>> >>> Suraj Fale >>> >>> +91-9766103115 >>> >>> >>> >>> >>> >>> -- >>> >>> 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 grou
Re: [algogeeks] Re: Suggestion
thanks everybody for so many suggestions... :) On Sat, Aug 27, 2011 at 6:40 AM, Rahul wrote: > If the seeker wants to do entire self study , then I would suggest CS > 106B Reader , it's in C ++ , BUT ideal for people who rely only on > internet. ALso that Data STructure USing C ,Book by Y. KAnitikar , I > never saw any math in any chapters for analysis of algorithms they > write > . lol. Google it as CS106B reader. > > On 8/26/11, sukran dhawan wrote: > > wat are u tying to say :P ? is that a good book or wat ? > > > > On Fri, Aug 26, 2011 at 7:55 PM, saurabh singh > wrote: > > > >> Yayashwant kanitekar and deepali srivastava are great books > >> > >> If you find all the mistakes that they have made you have learned DS(and > >> coding style) quite well.:p > >> > >> On Fri, Aug 26, 2011 at 2:44 PM, Suraj Fale > wrote: > >> > >>> A book by 'Yashwant Kanetkar' > >>> > >>> > >>> On Fri, Aug 26, 2011 at 9:03 AM, Navneet > wrote: > >>> > >>>> Ankit, i would also like to mention Mark Allan Weiss book on Data > >>>> Structures. Available in both C and C++ (different books) > >>>> > >>>> On Aug 25, 3:59 pm, Abhishek wrote: > >>>> > for simplicity use, > >>>> > Data Structures Through C in Depth -S. K. Srivastava, Deepali > >>>> Srivastava > >>>> > > >>>> > all the topics are discussed in very simple manner. > >>>> > >>>> -- > >>>> 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 > >>> Suraj Fale > >>> +91-9766103115 > >>> > >>> > >>> -- > >>> 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. > > > > > > > -- > Rahul > > -- > 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. > > -- *Thanks & Regards* *Ankit Arun Training Placement Representative Information Technology NIT Durgapur BLOG*: www.obeyurthirst.blogspot.com <http://www.obeyankit.blogspot.com> *Mobile No. - +91 9635333100* -- 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
Plz suggest me a good book for "Data structure in C." -- 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/-/q93wVIu_W9IJ. 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: Some adobe interview questions.
no 7000 is not possible because, '7' is also there so you have to
mention at the index of '7' that it is there 1 time..
On Jul 6, 12:32 am, aditya kumar wrote:
> in 7000 : '0' occurs seven times and rst of the numbers occur zero
> times. i still dint get where i am wrong . plz explain me .
>
>
>
>
>
>
>
> On Wed, Jul 6, 2011 at 12:47 AM, L wrote:
> > @aditya : I am wondering how many times 7 has occurred. Is it 1? Or is
> > it 0?
>
> > Please take a moment before posting your solution, and think whether
> > it is write or wrong!
>
> > On Jul 6, 12:11 am, aditya kumar wrote:
> > > Q3. ans:7000 i guess this is also a correct answer and no unique soln
> > as
> > > such
>
> > > On Wed, Jul 6, 2011 at 12:37 AM, aditya kumar
> > > wrote:
>
> > > > boolean palindromeCheck(String string)
> > > > {
> > > > len=string.length();
> > > > if((string.length()>1))
> > > > {
> > > > if((string.charAt(0)==string.charAt(len-1)))
> > > > {
> > > > str="";
> > > > str=str+string.substring(1,(len-1));
> > > > palindromeCheck(str);
> > > > }
> > > > else
> > > > {
> > > > flag=false;
> > > > }
> > > > }
> > > > return flag;
> > > > }
>
> > > > THis also works fine if you dont want to use pointer
>
> > > > On Tue, Jul 5, 2011 at 9:37 PM, Azhar Hussain
> > wrote:
>
> > > >> For Q4: I think this is the optimal code
>
> > > >> int recurPalin(char *start, char *end)
> > > >> {
> > > >> if (end < start)
> > > >> return true;
>
> > > >> if (*start != *end)
> > > >> return false;
>
> > > >> return recurPalin(start+1, end-1);
> > > >> }
>
> > > >> -
> > > >> Azhar.
>
> > > >> On Tue, Jul 5, 2011 at 12:21 PM, vikas wrote:
>
> > > >>> My program for Q4.
> > > >>> // recursively find if a given string is palindrome
> > > >>> bool IsPalindrome(string s, int start, int start2, bool flag)
> > > >>> {
> > > >>> bool flag1 = flag;
> > > >>> if (start >= 0 && start2 < (s.Length))
> > > >>> {
> > > >>> char c1 = s[start];
> > > >>> char c2 = s[start2];
> > > >>> if (c1.Equals(c2))
> > > >>> {
> > > >>> if (start == 0 && start2 == s.Length - 1) { flag
> > =
> > > >>> true; }
> > > >>> if (IsPalindrome(s, start - 1, start2 + 1, flag))
> > > >>> {
> > > >>> flag1 = true;
> > > >>> }
> > > >>> }
> > > >>> }
> > > >>> return flag1;
> > > >>> }
>
> > > >>> while calling
> > > >>> if (s.Length % 2 != 0)
> > > >>> {
> > > >>> p.IsPalindrome(s, s.Length / 2 - 1, s.Length / 2 + 1,
> > > >>> false);
> > > >>> }
> > > >>> else
> > > >>> {
> > > >>> p.IsPalindrome(s, s.Length / 2 - 1, s.Length / 2,
> > false);
>
> > > >>> }
>
> > > >>> --
> > > >>> 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/-/I6SVTB0o-uUJ.
>
> > > >>> 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.
[algogeeks] Re: MS Interview
part 1 can be solved in O(1) complexity.. first adding all the numbers
and then subtracting it from 4,000,000,000 will give the result.
On Jun 9, 2:45 pm, Dumanshu wrote:
> Q1. I have a file in which there are supposed to be 4 billion
> numbers,
> starting from 1 to 4,000,000,000 but unfortunately one number is
> missing,
> i.e there are only 3,999,999,999 numbers, I need to find the missing
> number.
>
> Q2. I have an array consisting of 2n+1 elements. n elements in it are
> married, i.e they occur twice in the array, however there is one
> element
> which only appears once in the array. I need to find that number in a
> single pass using constant memory. {assume all are positive numbers}
> Eg :- 3 4 1 3 1 7 2 2 4
> Ans:- 7
--
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] Digest for algogeeks@googlegroups.com - 25 Messages in 7 Topics
grawal Jun 09 04:08PM +0530 > ^<#130742ba4deca0ba_digest_top> > >Discussed many times, >1) add some lines to merge sort >2) use Binary indexed tree for a faster version (i have not tried but >get to >know it can be done using binary indexed tree) > > >-- >Sunny Aggrawal >B-Tech IV year,CSI >Indian Institute Of Technology,Roorkee > > > > >"D.N.Vishwakarma@IITR " Jun 09 04:22PM +0530 > ^<#130742ba4deca0ba_digest_top> > >thanx for suggestion > > >-- >**With Regards >Deoki Nandan Vishwakarma >IITR MCA >* >* > > > > >Navneet Gupta Jun 09 04:27PM +0530 > ^<#130742ba4deca0ba_digest_top> > >Insertion sort also would do. > > >-- >--Navneet > > > > >"D.N.Vishwakarma@IITR " Jun 09 04:29PM +0530 > ^<#130742ba4deca0ba_digest_top> > >how insertion sort will do in O(nlogn)? > > >-- >**With Regards >Deoki Nandan Vishwakarma >IITR MCA >* >* > > > > >Navneet Gupta Jun 09 04:24AM -0700 > ^<#130742ba4deca0ba_digest_top> > >Ohh. Missed out the nlogn condition you mentioned. It will do but in >n^2 > >Sent from my Windows Phone >-- >From: D.N.Vishwakarma@IITR >Sent: Thursday, 9 June 2011 4:29 PM >To: algogeeks@googlegroups.com >Subject: Re: [algogeeks] Finding total number of inversions in an array >in >O(nlogn) complexity . > >how insertion sort will do in O(nlogn)? > >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. > >-- >**With Regards >Deoki Nandan Vishwakarma >IITR MCA >* >* > >-- >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. > > > > Topic: [brain teaser ] Secret Code puzzle 9 > june<http://groups.google.com/group/algogeeks/t/9b30bedad752a65f> > >nicks Jun 09 02:19AM -0700 > ^<#130742ba4deca0ba_digest_top> > >Simple Problem :( > > > > > >varun pahwa Jun 09 03:25PM +0530 > ^<#130742ba4deca0ba_digest_top> > >please explain abt the order what if i say first number as ones, second >tens, so can this be also a answer 85647.please correct me if i am >wrong. > > >-- >Varun Pahwa >B.Tech (IT) >7th Sem. >Indian Institute of Information Technology Allahabad. >Ph : 09793899112 ,08011820777 >Official Email :: rit2008...@iiita.ac.in >Another Email :: varunpahwa.ii...@gmail.com > >People who fail to plan are those who plan to fail. > > > > Topic: Please Ban > Sohail<http://groups.google.com/group/algogeeks/t/fcd5a641f22d77ed> > >Naveen Kumar Jun 09 03:10PM +0530 > ^<#130742ba4deca0ba_digest_top> > >Hi Moderators, >Can you please Ban Sohail from algogeeks? >We are receiving a lot of spams from him. >sohail.panz...@gmail.com > >-- >Cheers >Naveen Kumar > > > > Topic: Regular Expressions > Implementation<http://groups.google.com/group/algogeeks/t/400314518978bc7e> > >Navneet Gupta Jun 09 02:56PM +0530 > ^<#130742ba4deca0ba_digest_top> > >So i assume your ask is given a string, check if it can be formed with >the >regular expression you have. Is that correct? > >The above can be implemented easily with stacks. >Ex - Reg Expression - a*bc* >And String - aabccc > >Put all instances of char that are consecutive on the stack and then >pop the >top element and match it with the regex element (assume some pointer we >have >for regex), now you increment the regex pointer, if you see a different >character and your stack is not empty, we get false condition. > >If we see a *, we keep popping all instances of last seen character. >Once >all such characters are popped, you are ready to process remaining of >string >anf regex in similar fashion. > >Thanks, >Navneet > >P.S. This example only had a *, while regex can have more such symbols >such >as ? etc and problem will become little more complicated if we have >multiple >such characters. > > > > > > > -- > 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. > MS part 1 can be done in O(n) complexity as calculating the sum and subtracting it from 4,000,000,000 would give the result -- *Thanks & Regards* *Ankit Arun Final Year Information Technology NIT Durgapur BLOG*: www.obeyurthirst.blogspot.com <http://www.obeyankit.blogspot.com> -- 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.
