Sent from BlackBerry® on Airtel -----Original Message----- From: algogeeks@googlegroups.com Sender: algogeeks@googlegroups.com Date: Mon, 12 Sep 2011 18:58:37 To: Digest Recipients<algogeeks@googlegroups.com> Reply-To: algogeeks@googlegroups.com Subject: [algogeeks] Digest for algogeeks@googlegroups.com - 25 Messages in 11 Topics
============================================================================= Today's Topic Summary ============================================================================= Group: algogeeks@googlegroups.com Url: http://groups.google.com/group/algogeeks/topics - pgm2 [3 Updates] http://groups.google.com/group/algogeeks/t/6c60a3a4fe24efa8 - InfoEdge [3 Updates] http://groups.google.com/group/algogeeks/t/6397d816995ac73b - pgm3 [1 Update] http://groups.google.com/group/algogeeks/t/8308efb8d64fb38d - String [4 Updates] http://groups.google.com/group/algogeeks/t/991ef9c51b927651 - unique no. problem [2 Updates] http://groups.google.com/group/algogeeks/t/8ee0ebcc62da1262 - Can anyone tell Directi written questions . I'm not asking interview questions... Thanx in advance [1 Update] http://groups.google.com/group/algogeeks/t/1feff3fbf9038b69 - ms question [3 Updates] http://groups.google.com/group/algogeeks/t/ed0d1e6c3cd3ef7b - Returning 0 with probability p and 1 with probability 1-p [3 Updates] http://groups.google.com/group/algogeeks/t/1477113b0448097b - ELitmus test [2 Updates] http://groups.google.com/group/algogeeks/t/d1c11f9b2a1aee19 - MS test cases type Questions [1 Update] http://groups.google.com/group/algogeeks/t/c473c645cb9ae27e - MICROSOFT WRITTEN [2 Updates] http://groups.google.com/group/algogeeks/t/526a5ce27d32fe3 ============================================================================= Topic: pgm2 Url: http://groups.google.com/group/algogeeks/t/6c60a3a4fe24efa8 ============================================================================= ---------- 1 of 3 ---------- From: parag khanna <khanna.para...@gmail.com> Date: Sep 13 12:11AM +0530 Url: http://groups.google.com/group/algogeeks/msg/6e6d108323212468 .write a program to find out if a word is a possible palindrome or not...eg:tsetes becomes a palindrome aftr rearranging the letters so it is a valid palindrome -- Parag Khanna B.tech Final Year NIT,Kurukshetra ---------- 2 of 3 ---------- From: Gaurav Popli <abeygau...@gmail.com> Date: Sep 13 12:25AM +0530 Url: http://groups.google.com/group/algogeeks/msg/60466f2ff0e89a2b jsut count the frequencies of each alphabet....if the length is odd then all even except one else all even.. ---------- 3 of 3 ---------- From: ankita aggarwal <ankita.aggarwal....@gmail.com> Date: Sep 13 12:27AM +0530 Url: http://groups.google.com/group/algogeeks/msg/be00be5a79cba680 count the frequency of each letter.Only one odd or all even frequencies will form palindromes. -- Ankita Aggarwal UG Student PEC University of Technology, Chandigarh. ============================================================================= Topic: InfoEdge Url: http://groups.google.com/group/algogeeks/t/6397d816995ac73b ============================================================================= ---------- 1 of 3 ---------- From: raj singh <ankurkaku...@gmail.com> Date: Sep 12 11:56PM +0530 Url: http://groups.google.com/group/algogeeks/msg/e4fbca8e6f270486 InfoEdge is going to visit in my collage. Anyone knows which type of question ask in written test and interview. ---------- 2 of 3 ---------- From: parag khanna <khanna.para...@gmail.com> Date: Sep 13 12:02AM +0530 Url: http://groups.google.com/group/algogeeks/msg/8eb3b783dfe25656 online test hoga apti + tech 15 questions each -- Parag Khanna B.tech Final Year NIT,Kurukshetra ---------- 3 of 3 ---------- From: raj singh <ankurkaku...@gmail.com> Date: Sep 13 12:04AM +0530 Url: http://groups.google.com/group/algogeeks/msg/f6f49637d0ea1f81 online me apti aur technical question dono hoge kya? ============================================================================= Topic: pgm3 Url: http://groups.google.com/group/algogeeks/t/8308efb8d64fb38d ============================================================================= ---------- 1 of 1 ---------- From: parag khanna <khanna.para...@gmail.com> Date: Sep 13 12:12AM +0530 Url: http://groups.google.com/group/algogeeks/msg/65e8115a31ff22da .eg:[5 6 2 8 1] or [4 7 9 2 4]...such arrays are given, you have to find possible pairs where sum of numbers in both arrays of a pair is equal....eg for the first case it will be [5 6] and [2 8 1] write a program to implement this -- Parag Khanna B.tech Final Year NIT,Kurukshetra ============================================================================= Topic: String Url: http://groups.google.com/group/algogeeks/t/991ef9c51b927651 ============================================================================= ---------- 1 of 4 ---------- From: guna sekaran <vgun...@gmail.com> Date: Sep 12 11:08AM -0700 Url: http://groups.google.com/group/algogeeks/msg/bc67fcfbf32775e1 String Reverse: input : welcome to all output: all to welcome ---------- 2 of 4 ---------- From: abhinav gupta <guptaabhinav...@gmail.com> Date: Sep 12 11:24AM -0700 Url: http://groups.google.com/group/algogeeks/msg/a8ee68a84b0d13de First reverse the whole string then reverse the individual words .Simple ! -- @ |3 # ! /\/ @ \./ ---------- 3 of 4 ---------- From: Kapil Gupta <kapilkeda...@gmail.com> Date: Sep 12 11:59PM +0530 Url: http://groups.google.com/group/algogeeks/msg/7a0627ae263f71c0 convert each word to a token in linked list than print the reversal. On Mon, Sep 12, 2011 at 11:54 PM, abhinav gupta -- Regards KAPIL GUPTA COMPUTER ENGINEERING NIT JAIPUR ---------- 4 of 4 ---------- From: hary rathor <harry.rat...@gmail.com> Date: Sep 13 12:05AM +0530 Url: http://groups.google.com/group/algogeeks/msg/e58dcd0bd63ae8ee kapil : in your solution you are required extra O(n+n*sizeOf(int *)) both memory to create a link list that really costly ============================================================================= Topic: unique no. problem Url: http://groups.google.com/group/algogeeks/t/8ee0ebcc62da1262 ============================================================================= ---------- 1 of 2 ---------- From: Ankuj Gupta <ankuj2...@gmail.com> Date: Sep 12 11:11AM -0700 Url: http://groups.google.com/group/algogeeks/msg/f1fa46880b31524d Is there any restriction on the input like they are in given range ? ---------- 2 of 2 ---------- From: Ankur Garg <ankurga...@gmail.com> Date: Sep 12 11:43PM +0530 Url: http://groups.google.com/group/algogeeks/msg/479a76ddcf80750b ^+1 ============================================================================= Topic: Can anyone tell Directi written questions . I'm not asking interview questions... Thanx in advance Url: http://groups.google.com/group/algogeeks/t/1feff3fbf9038b69 ============================================================================= ---------- 1 of 1 ---------- From: Deoki Nandan <deok...@gmail.com> Date: Sep 12 10:47PM +0530 Url: http://groups.google.com/group/algogeeks/msg/c8a4339965e45275 Thanks a lot buddy -- **With Regards Deoki Nandan Vishwakarma * * ============================================================================= Topic: ms question Url: http://groups.google.com/group/algogeeks/t/ed0d1e6c3cd3ef7b ============================================================================= ---------- 1 of 3 ---------- From: Piyush Grover <piyush4u.iit...@gmail.com> Date: Sep 12 10:08PM +0530 Url: http://groups.google.com/group/algogeeks/msg/29cc5dba65f96354 it should be: (1/n)^n * (1 + 2 + 2^2 + 2^3 +....(n/2)+1 terms) = {2^(1 + n/2) - 1}*(1/n)^n when n even (1/n)^n * (1 + 2 + 2^2 + 2^3 +....(n-1/2)+1 terms) = {2^(1 + (n-1)/2) - 1}*(1/n)^n when n is odd -Piyush ---------- 2 of 3 ---------- From: Piyush Grover <piyush4u.iit...@gmail.com> Date: Sep 12 10:15PM +0530 Url: http://groups.google.com/group/algogeeks/msg/2d25bf444da2f662 Sry i was little wrong: nC0*(1/n)^n + nC2 *2*(1/n)^n + nC4*2^2*(1/n)^n+....+nCn*2^(n/2)*(1/n)^n when n is even nC0*(1/n)^n + nC2 *2*(1/n)^n + nC4*2^2*(1/n)^n+....+nCn-1*2^(n-1/2)*(1/n)^n when n is odd On Mon, Sep 12, 2011 at 10:08 PM, Piyush Grover ---------- 3 of 3 ---------- From: payal gupta <gpt.pa...@gmail.com> Date: Sep 12 10:24PM +0530 Url: http://groups.google.com/group/algogeeks/msg/1d84909f6870ecf0 @piyush.. cud u plzz..xplain...n elaborate Regards, Payal Gupta On Mon, Sep 12, 2011 at 10:15 PM, Piyush Grover ============================================================================= Topic: Returning 0 with probability p and 1 with probability 1-p Url: http://groups.google.com/group/algogeeks/t/1477113b0448097b ============================================================================= ---------- 1 of 3 ---------- From: Anup Ghatage <ghat...@gmail.com> Date: Sep 12 09:18PM +0530 Url: http://groups.google.com/group/algogeeks/msg/e3409ea33fdc2648 Don, how did you come up with 1073741824.0 ? -- Anup Ghatage ---------- 2 of 3 ---------- From: siddharth srivastava <akssps...@gmail.com> Date: Sep 12 09:18PM +0530 Url: http://groups.google.com/group/algogeeks/msg/d9165271eaeec389 > n += n+f(); > return n > (int)(p*1073741824.0); > } explain the magic numbers please ;) -- Regards Siddharth Srivastava ---------- 3 of 3 ---------- From: Don <dondod...@gmail.com> Date: Sep 12 09:17AM -0700 Url: http://groups.google.com/group/algogeeks/msg/f07c72bc0bae9038 It uses 30 random bits from f() to build a 30-digit number which will be in the range 0..2^30. 2^30 is 1,073,741,824. p*2^32 is the number of values in that range which should produce the result 0. Don ============================================================================= Topic: ELitmus test Url: http://groups.google.com/group/algogeeks/t/d1c11f9b2a1aee19 ============================================================================= ---------- 1 of 2 ---------- From: 9ight coder <9ightco...@gmail.com> Date: Sep 12 08:51AM -0700 Url: http://groups.google.com/group/algogeeks/msg/7f55dc87cee9c3d1 thanks akanksha its really helped me ---------- 2 of 2 ---------- From: parag khanna <khanna.para...@gmail.com> Date: Sep 12 09:35PM +0530 Url: http://groups.google.com/group/algogeeks/msg/8fb00af196376ac4 full CAT type -- Parag Khanna B.tech Final Year NIT,Kurukshetra ============================================================================= Topic: MS test cases type Questions Url: http://groups.google.com/group/algogeeks/t/c473c645cb9ae27e ============================================================================= ---------- 1 of 1 ---------- From: "pg@manit" <gpt.pa...@gmail.com> Date: Sep 12 08:42AM -0700 Url: http://groups.google.com/group/algogeeks/msg/5eb83b9d10669ce4 Cud some 1 suggest me 4m how 2 practise test cases type of questions which usually cum in MS written Papers? thanx..in advance Regards, PAYAL GUPTA ============================================================================= Topic: MICROSOFT WRITTEN Url: http://groups.google.com/group/algogeeks/t/526a5ce27d32fe3 ============================================================================= ---------- 1 of 2 ---------- From: Vikram Singh <singhvikram...@gmail.com> Date: Sep 12 04:51AM -0700 Url: http://groups.google.com/group/algogeeks/msg/1057c5c37088f6ac how abt this: (i hv used some variables) a=x; b=-x; k1=a>>7; (if we assume 8 bit number) k2=b>>7; n=k1 | k2; n=n-1; k=n>>7; return (y-k*(y-z)); Explanation: if(x>0 or x<0) a and b are of opp signs, one of k1 and k2 is 0and other is 1... n=1; n becomes 0; k =0; y is returned.... if(x==0) a=b=0; k1=k2=0; n=0; n becomes -1 k becomes 1; z is returned... correct me if i m wrong... and it can be reduced in a single statement... ---------- 2 of 2 ---------- From: beginner <shubh2...@gmail.com> Date: Sep 12 05:02AM -0700 Url: http://groups.google.com/group/algogeeks/msg/4c349cf61a81e1e6 although multiplication operator is not allowed.. but it's an attempt to write shorter... c++ implementation- int cond(int x, int y, int z){ return y*(int)((bool)x)+z*(1+(~(int)((bool)x)+1)); } -- 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.
