@aditya: comparing isn't complexity here... here it means no. of comparisons between 2 numbers...
On Sat, Sep 17, 2011 at 5:04 PM, aditya kumar <aditya.kumar130...@gmail.com>wrote: > @yogesh: we can get second max by comparing n elements ie O(n). > > > On Sat, Sep 17, 2011 at 4:59 PM, Ashima . <ashima.b...@gmail.com> wrote: > >> ans 8: >> it should be 40% >> @dheeraj: if total is 100 percent and other person paid more than 1st >> person.Than how can the 1st person's percentage be more than 50%? >> >> Ashima >> M.Sc.(Tech)Information Systems >> 4th year >> BITS Pilani >> Rajasthan >> >> >> >> >> On Sat, Sep 17, 2011 at 4:20 AM, Yogesh Yadav <medu...@gmail.com> wrote: >> >>> Ans 1. apply bubble sort. outer loop should run just two times because in >>> 2nd time the 2nd largest element will be at 2nd last position... >>> comparisons=(n-1)+(n-2) >>> >>> On Sat, Sep 17, 2011 at 4:27 PM, Ashima . <ashima.b...@gmail.com> wrote: >>> >>>> ans 2: >>>> http://www.qbyte.org/puzzles/p131s.html >>>> >>>> Ashima >>>> M.Sc.(Tech)Information Systems >>>> 4th year >>>> BITS Pilani >>>> Rajasthan >>>> >>>> >>>> >>>> >>>> On Sat, Sep 17, 2011 at 1:46 AM, Ashima . <ashima.b...@gmail.com>wrote: >>>> >>>>> ans1: i think 2n but may be better solution is posible >>>>> Ashima >>>>> M.Sc.(Tech)Information Systems >>>>> 4th year >>>>> BITS Pilani >>>>> Rajasthan >>>>> >>>>> >>>>> >>>>> >>>>> On Fri, Sep 16, 2011 at 11:19 PM, Dheeraj Sharma < >>>>> dheerajsharma1...@gmail.com> wrote: >>>>> >>>>>> ans 7. - 15 km east and 12 km south of origin >>>>>> >>>>>> >>>>>> On Sat, Sep 17, 2011 at 11:29 AM, Dheeraj Sharma < >>>>>> dheerajsharma1...@gmail.com> wrote: >>>>>> >>>>>>> Ans 8. 62.5 % ??? >>>>>>> >>>>>>> >>>>>>> On Sat, Sep 17, 2011 at 9:11 AM, VIHARRI <viharri....@gmail.com>wrote: >>>>>>> >>>>>>>> 1. Minimum no.of comparisons required to select the 2nd max element >>>>>>>> in >>>>>>>> an array of N numbers. >>>>>>>> >>>>>>>> 2. What are the number of counting ties for four horses. ( example >>>>>>>> for >>>>>>>> two horses A and B there are three cases - A wins, B wins, A & B >>>>>>>> ties ). >>>>>>>> >>>>>>>> 3. What are the minimum no.of tournaments needed to get the winner. >>>>>>>> A >>>>>>>> player is out when he loses two matches. Total players are 51. >>>>>>>> ( Badminton ). >>>>>>>> >>>>>>>> 4. while(true) >>>>>>>> { >>>>>>>> sleep 1sencond; >>>>>>>> if( getpid() % 2 == 0 ) >>>>>>>> { >>>>>>>> fork(); >>>>>>>> } >>>>>>>> } >>>>>>>> How many no.of processes are created by the end of 12th second, if >>>>>>>> time starts from 0th second? Process id's start from 0. >>>>>>>> >>>>>>>> 5. Which of the following are thread safe? >>>>>>>> a) Atomic operations >>>>>>>> b) Mutual exclusion >>>>>>>> c) Re-entrant >>>>>>>> d) Queuing >>>>>>>> >>>>>>>> 6. When a dice is rolled the outcome of the face is summed up each >>>>>>>> time, and rolling is stopped when the sum becomes greater than 100. >>>>>>>> Which of the following have more probability to become sum. >>>>>>>> a) 103 >>>>>>>> b) 102 >>>>>>>> c) 100 >>>>>>>> d) all have equal probability >>>>>>>> e) 101 >>>>>>>> >>>>>>>> 7. A man moves 1km east, 2km north, 3km west, 4km south, 5km east, >>>>>>>> 6km >>>>>>>> north, 7km west and so on until he travels total of 300km.... so >>>>>>>> what >>>>>>>> will be the distance from origin? >>>>>>>> >>>>>>>> 8. Alam bought 5pens, 7 pencils, 4 erasers. Ashok bought 6 pens, 8 >>>>>>>> erasers, 14 pencils and paid half more the amount Alam paid. What is >>>>>>>> the percentage of amount did Alam spent on buying pens? >>>>>>>> >>>>>>>> 9. Time complexity to get min elements from MAX heap. >>>>>>>> >>>>>>>> -- >>>>>>>> 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* >>>>>>> Comp Engg. >>>>>>> NIT Kurukshetra >>>>>>> >>>>>>> >>>>>>> >>>>>> >>>>>> >>>>>> -- >>>>>> *Dheeraj Sharma* >>>>>> Comp Engg. >>>>>> NIT Kurukshetra >>>>>> >>>>>> >>>>>> -- >>>>>> 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. >> > > -- > 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.
