in networking give emphasis on protocols like ARP, DHCP and all On Sun, Aug 14, 2011 at 3:09 PM, htross <[email protected]> wrote:
> one more thing from networks should we study theory concepts or > programming constructs???should we study object oriented concepts??? > > On Aug 14, 2:04 pm, sagar pareek <[email protected]> wrote: > > no c > > only C++ > > questions mainly were to get the o/p of program > > > > > > > > > > > > > > > > > > > > On Sun, Aug 14, 2011 at 1:30 PM, htross <[email protected]> wrote: > > > was the aptitude on c or c++???i mean did the aptitude contain > > > questions on classes and objects??? > > > > > On Aug 14, 2:00 am, sagar pareek <[email protected]> wrote: > > > > sorry it is 3 hand written codes in 1 hour > > > > > > On Sun, Aug 14, 2011 at 2:29 AM, sagar pareek <[email protected] > > > > > wrote: > > > > > First they have writtwen (45 quwestions in 60 mins) > > > > > Major (70-80% + ) on C++ .. simple... no need to study in deep > > > > > networking.... need deep study... > > > > > Some apti > > > > > i dont remember of apti and os (if it is there then it has very > less > > > part) > > > > > > > then 1 hour > > > > > 23 hand written codes > > > > > > > logic based...no need a good coder but know how to do in best way > > > > > mine questions were > > > > > > > 1. array given with two neighbor elements have distance of -1,0or 1 > > > > > like > > > > > > > 6,6,5,5,6,5,4,3,2,1,1,0 > > > > > > > find 2 > > > > > logic is simple > > > > > take diff b/w given no. and array element and then jump to the > location > > > > > with the diff > > > > > > > 2. > > > > > array given in decreasing then increasing order..... > > > > > find number > > > > > like > > > > > 9 8 7 6 1 2 3 4 5 > > > > > > > 3. rotate 2-d matrix in place (mean in O(1) space) > > > > > first transpose and then swap columns > > > > > > > On Sat, Aug 13, 2011 at 11:34 PM, htross <[email protected]> wrote: > > > > > > >> any one else who has wrote citrix r&d this year???please please > > > > >> reply.....a last ray of hope > > > > > > >> On Aug 13, 10:59 pm, Yasir <[email protected]> wrote: > > > > >> > I havn't attended citrix's campus drive this year. > > > > >> > This is the last year's process. Hopefully would be same. :) > > > > > > >> > Good Luck! > > > > > > >> -- > > > > >> You received this message because you are subscribed to the Google > > > Groups > > > > >> "Algorithm Geeks" group. > > > > >> To post to this group, send email to [email protected]. > > > > >> To unsubscribe from this group, send email to > > > > >> [email protected]. > > > > >> For more options, visit this group at > > > > >>http://groups.google.com/group/algogeeks?hl=en. > > > > > > > -- > > > > > **Regards > > > > > SAGAR PAREEK > > > > > COMPUTER SCIENCE AND ENGINEERING > > > > > NIT ALLAHABAD > > > > > > -- > > > > **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 [email protected]. > > > To unsubscribe from this group, send email to > > > [email protected]. > > > 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
