[algogeeks] Direct paper
Hi friends, http://www.iitplacementpapers.com/2012/09/directi-placement-papers-2011-2012.html -- With Regards, N.Vamshi Vijay, Mtech,CSE, IIT Kharagpur, --
Re: [algogeeks] Re: Inmobi Placement Paper
@Dave Yes u are right.. answers are not mine. I just collected the papers so that it would be useful for others to prepare Anyhow thanks On 2 December 2012 06:23, Dave dave_and_da...@juno.com wrote: @Vamshi: The first answer should be min heap, not max heap. The reason is that you want to know what the smallest of the ten largest numbers you've found so far. So the algorithm is to place the first 10 numbers into the min heap. For each additional number x, if x is greater than the root of the heap (min element of the current top ten), then replace the root with x and re-establish the heap condition. When you are finished with the input, the numbers in the heap will be the largest ten numbers in the file. Dave On Saturday, December 1, 2012 11:54:22 AM UTC-6, vamshi vijay wrote: Hi friends http://www.iitplacementpapers.**com/2012/09/inmobi-previous-** placment-papers.htmlhttp://www.iitplacementpapers.com/2012/09/inmobi-previous-placment-papers.html -- With Regards, N.Vamshi Vijay, Mtech,CSE, IIT Kharagpur, Software Developer, Amazon India Development Center. -- -- With Regards, N.Vamshi Vijay, Mtech,CSE, IIT Kharagpur, Software Developer, Amazon India Development Center. Mobile:- 09000213029. --
[algogeeks] Oracle Placement Papers
Hi Friends http://www.iitplacementpapers.com/2012/09/oracle-placement-paper-2011-2012-iits.html -- With Regards, N.Vamshi Vijay, Mtech,CSE, IIT Kharagpur, Software Developer, Amazon India Development Center. --
[algogeeks] YAhoo PlacementPaper Friends
Hi Friends.. http://www.iitplacementpapers.com/2012/09/yahoo-campus-placement-papers-iits-nits.html -- With Regards, N.Vamshi Vijay, Mtech,CSE, IIT Kharagpur, Software Developer, Amazon India Development Center. --
[algogeeks] Inmobi Placement Paper
Hi friends http://www.iitplacementpapers.com/2012/09/inmobi-previous-placment-papers.html -- With Regards, N.Vamshi Vijay, Mtech,CSE, IIT Kharagpur, Software Developer, Amazon India Development Center. --
Re: [algogeeks] Circular Left shift
reverse(s); // reverse string S reverse(1,n-k); // reverse first n-k characters reverse(n-k+1,n) // reverse remaining Time complexity :O(n),space : O(1) On 10 September 2011 21:53, praveen raj praveen0...@gmail.com wrote: Whatever changes have been made in array in first step 1 will be continue to 2nd step(reverse the n-k elements) With regards, Praveen Raj DCE-IT 3rd yr 735993 praveen0...@gmail.com On Sun, Sep 11, 2011 at 9:51 AM, bharatkumar bagana bagana.bharatku...@gmail.com wrote: @praveen: will u pls explain the second step ... i didn't understand .. On Sat, Sep 10, 2011 at 8:09 PM, praveen raj praveen0...@gmail.comwrote: @amrit... +1 .. With regards, Praveen Raj DCE-IT 3rd yr -- 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. -- **Please do not print this e-mail until urgent requirement. Go Green!! Save Papers = Save Trees *BharatKumar Bagana* **http://www.google.com/profiles/bagana.bharatkumarhttp://www.google.com/profiles/bagana.bharatkumar * Mobile +91 8056127652* bagana.bharatku...@gmail.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. -- 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. -- With Regards, N.Vamshi Vijay, Mtech,CSE IIT Kharagpur Mobile:-07501541110 -- 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] pls help
@Sagar See at level 4, 81 leaf nodes are possible, since in question it has been given 28 leaf nodes, if i use just 10 nodes from level 3 (27 nodes), i can get 28 leaves, but if u observe the remaining 17 nodes in the 3rd level are also becoming leaf nodes, but in question given as 28 leaf nodes..Plz correct me. What i feel is we can have 2 cases 1) Minimum internal nodes posible If we can observe nodes pattern in each level 1 3 9 27 so in 4th level there are 27 leaf nodes, to get 28 leaf nodes, select one from 27 nodes and add 2 childs, so total leaf nodes become (27-1)+2=28 In this case, internal nodes= 1+3+9+1=14 2) maximum internal nodes in the 4th level, add one child to each node, we get 27 leaf nodes in 5th level and similarly select 1nodes in 5th level and add 2 childs to make nodes 28, now we have interal nodes= 1+3+9+27+1=41 Correct me if wrong... On 10 August 2011 05:19, sagar pareek sagarpar...@gmail.com wrote: Excatly why dont u just make a rough diagram in paper for binary and ternary trees and just see that each level has max of 2/3^i where 2/3 is for binary/ternary tree and i is level where root level is 0... then make a complete ternary tree and see why leaves with 28 in numbers have internal nodes 40... just do it and then u will learn On Wed, Aug 10, 2011 at 4:58 PM, Brijesh Upadhyay brijeshupadhyay...@gmail.com wrote: It could have a maximum of 81 leaves with the same '40' no of internal nodes so for any value between 28 to 81, it would have only 40 internal nodes -- 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/-/hb7mifIIe1kJ. 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 SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT 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. -- With Regards, N.Vamshi Vijay, Mtech,CSE IIT Kharagpur Mobile:-07501541110 -- 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: Link list problem..
Let the present node be X, Crete a new node 'Y' and give X-next=Y. Then swap(X-data,Y-data) On 8 August 2011 09:06, Abhishek Gupta mailatabhishekgu...@gmail.comwrote: Errata: sorry guys.. there is a change in the problem.. actually we have to INSERT a NEW NODE before the current pointer. Now tell is it possible.. or again it is a stupid question.. -- 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/-/JTEcmoixuksJ. 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. -- With Regards, N.Vamshi Vijay, Mtech,CSE IIT Kharagpur Mobile:-07501541110 -- 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.
