nope sam primilarity testing is not sufficient.... On Mon, Sep 5, 2011 at 9:17 PM, SAMM <somnath.nit...@gmail.com> wrote:
> Question no 1: > > Find the fibonacci number as usual and check whether the current > fibonacci numbed is prime using Miller primality test .Tht will do... > > On 9/5/11, sagar pareek <sagarpar...@gmail.com> wrote: > > thanks bharat > > > > On Mon, Sep 5, 2011 at 1:47 PM, bharatkumar bagana < > > bagana.bharatku...@gmail.com> wrote: > > > >> http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm > >> For Q4): Dijkstra is the best one .. as there is no root for negative > >> weight edge ... > >> Floyds algo gives all pairs shortest path with negative weight edges > also > >> .. so that doesn't work in this situation ... > >> > >> > >> On Sun, Sep 4, 2011 at 6:22 PM, aditya kumar < > aditya.kumar130...@gmail.com > >> > wrote: > >> > >>> q4) floyds algorithm for shortest path . > >>> > >>> > >>> On Sun, Sep 4, 2011 at 5:41 PM, sukran dhawan > >>> <sukrandha...@gmail.com>wrote: > >>> > >>>> for q3 :either both inorder and preorder traversal shud be stored or > >>>> inorder and postorder shud be stored > >>>> > >>>> > >>>> On Sun, Sep 4, 2011 at 2:54 PM, sukran dhawan > >>>> <sukrandha...@gmail.com>wrote: > >>>> > >>>>> > >>>>> > >>>>> ---------- Forwarded message ---------- > >>>>> From: sukran dhawan <sukrandha...@gmail.com> > >>>>> Date: Sun, Sep 4, 2011 at 2:53 PM > >>>>> Subject: Re: [algogeeks] Tejas networks > >>>>> To: algogeeks@googlegroups.com > >>>>> > >>>>> > >>>>> reverse a linked list > >>>>> > >>>>> void reverse(struct node ** head) > >>>>> { > >>>>> struct node * last,*temp; > >>>>> > >>>>> last = *head; > >>>>> while(last->next != null) > >>>>> last = last->next; > >>>>> > >>>>> while(*head != last) > >>>>> { > >>>>> temp = *head; > >>>>> *head = (*head)->next; > >>>>> temp->next = last->next; > >>>>> last->next = temp > >>>>> } > >>>>> } > >>>>> > >>>>> On Sun, Sep 4, 2011 at 2:46 PM, Anup Ghatage <ghat...@gmail.com> > wrote: > >>>>> > >>>>>> Could you please give an example for question 3? > >>>>>> > >>>>>> -- > >>>>>> 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. > >>> > >> > >> > >> > >> -- > >> > >> **Please do not print this e-mail until urgent requirement. Go Green!! > >> Save Papers <=> Save Trees > >> *BharatKumar Bagana* > >> **http://www.google.com/profiles/bagana.bharatkumar< > http://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. > >> > > > > > > > > -- > > **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. > > > > > > > -- > Somnath Singh > > -- > 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. > > -- **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.
