Re: [algogeeks] Any one
Can you please elaborate... On Thu, Nov 24, 2011 at 12:14 AM, atul anand wrote: > > yes levenshtein distance and BK tree can be used to solve this. > where edge weight between nodes is equal to levenshtein distance. > > > On Wed, Nov 23, 2011 at 7:14 PM, abhishek kumar wrote: > >> You are given a word and a dictionary. Now propose an algorithm edit >> the word (insert / delete characters) minimally to get a word that >> also exists in the dictionary. Cost of insertion and deletion is same. >> Write pseudocode for it. >> >> Seems like minimum edit distance problem but some modification is >> needed. >> >> >> -- >> Abhishek Kumar >> B.Tech(IT) Graduate >> Allahabad >> Contact no-+919663082731 >> >> -- >> 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.
Re: [algogeeks] Re: RAID LEVEL
i think raid level 3 provide high transfer rate with single stream I/O applications such as graphical imaging processors , CAD/CAM files etc. On Wed, Aug 10, 2011 at 6:11 AM, Gary Drocella wrote: > RAID Level 0 is used for high performance where data loss isn't > critical. Bit stripping is still performed > over multiple disks, but no mirroring or parity bits used for checking > data integrity. > > On Aug 9, 2:56 pm, Vivek Srivastava > wrote: > > On Wed, Aug 10, 2011 at 12:22 AM, raghavendhra rahul < > > > > > > > > > > > > > > > > rahulraghavend...@gmail.com> wrote: > > > @krishnameena: i think its 5 > > > > > correct me if i m wrong > > > > > -- > > > > > Regards > > > Raghavendhra > > > > > It's Raid level 3 > > > "changing the face" can change nothing .. but "facing the change" can > > > change everything > > > > > -- > > > 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] os
Consider a set of n teaks with known runtimes r1,r2,r3rn to be run on a uni-processor machine. which processor scheduling algorithm will result in the maximum throughput? -- 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] RAID LEVEL
which raid level provide highest data transfer rate ? -- 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] DBMS
In an RDBMS with m attributes, how many superkeys are possible? -- 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] compiler
For any compiler generated temporaries the space is allocated in run time heap only? -- 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] Normal Form
1. A relation with two attributes is always in which form? options are 4NF BCNF 5NF DK/NF -- 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: Merge two BST in O(n) time with O(1)
Hi all, Lets say we do following steps to merge two BSTS's. Lets call them BST1 and BST2. 1. Check the value of root of BST2. 2. In BST1 find a place where root of BST2 can be put. 3. Remove the children from this place and store them as BST3 and BST4. 3. Attach BST2's root pointer at this place. We dont have to do anything more for BST2 as all children of BST2 are already at their proper place Now our BST1 has BST2 merged to it but it doesnt have BST3 and BST4. 4. Do inorder traversal of BST3 and BST4 and insert it to BST1. If we know the approximate size of BST1 and BST2 we can choose tree for our step 1 accordingly. This algorithm doesnt need any extra memory and can be almost O(n), if BST3 and BST4 are very small trees. Does anybody see any issues with this approach? Regards, Ashish On Fri, Jan 29, 2010 at 2:52 PM, vivek bijlwan wrote: > @ shingray ... cartesian trees are not BSTs . I guess nirmal's question > asks for a BST. > also cartesian trees have extra space requirements. > > > On Fri, Jan 29, 2010 at 12:07 AM, naga vinod kumar < > vinodkumark...@gmail.com> wrote: > >> hi varun ,it cant be in O(n) time ,it can be merged in O(nlogn) time. >> >> >> On Thu, Jan 28, 2010 at 10:37 PM, Varun S V wrote: >> >>> Delete the nodes in the second BST in postorder. As and when you delete >>> this node, insert it into the first BST. >>> >>> >>> >>> On Thu, Jan 28, 2010 at 9:35 PM, Bijlwan wrote: >>> >>>> hey nirmal . i don't get that when you merge the two linked list , >>>> how do you get the BST? >>>> making the BST would itself be a O(nlogn) process? >>>> >>>> On Jan 28, 5:03 am, Nirmal wrote: >>>> > Given two binary search trees, how to merge them in O(n) time and O(1) >>>> > space? >>>> > >>>> > It can be done using O(n) space as below, >>>> > >>>> > 1. covert BST #1 into linked list or sorted array >>>> > 2. covert BST #2 into linked list or sorted array >>>> > 3. merge them... >>>> > >>>> > but how to do this in place? >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> To post to this group, send email to algoge...@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 algoge...@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 algoge...@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 algoge...@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. > -- Ashish Meena -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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] workfrom home earn dollars withoutinvestment earn weekly$5000to$10000
workfrom home earn dollars withoutinvestment earn weekly$5000to$1 otherinformations logonto http://www.AWSurveys.com/HomeMain.cfm?RefID=shanmugam http://www.AWSurveys.com/HomeMain.cfm?RefID=shanmugam http://www.AWSurveys.com/HomeMain.cfm?RefID=shanmugam --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
