Re: [algogeeks] Tejas networks
nope sam primilarity testing is not sufficient
On Mon, Sep 5, 2011 at 9:17 PM, SAMM 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 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
> >>> 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
> >>>> wrote:
> >>>>
> >>>>>
> >>>>>
> >>>>> -- Forwarded message --
> >>>>> From: sukran dhawan
> >>>>> 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
> 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<
>
Re: [algogeeks] Tejas networks
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 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 > > wrote:
>>
>>> q4) floyds algorithm for shortest path .
>>>
>>>
>>> On Sun, Sep 4, 2011 at 5:41 PM, sukran dhawan
>>> 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
>>>> wrote:
>>>>
>>>>>
>>>>>
>>>>> -- Forwarded message --
>>>>> From: sukran dhawan
>>>>> 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 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*
>>
>>
>>
>> --
>> 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.
Re: [algogeeks] Tejas networks
hey can u pl tell me about the criteria and procedure and package
for tejas networks...
On Mon, Sep 5, 2011 at 9:00 PM, sagar pareek 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 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
>>>> wrote:
>>>>
>>>>>
>>>>>
>>>>> -- Forwarded message --
>>>>> From: sukran dhawan
>>>>> 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 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*
>>
>>
>>
>> --
>> 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.
>
--
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] Tejas networks
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 > wrote:
>
>> q4) floyds algorithm for shortest path .
>>
>>
>> On Sun, Sep 4, 2011 at 5:41 PM, sukran dhawan 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 wrote:
>>>
>>>>
>>>>
>>>> -- Forwarded message --
>>>> From: sukran dhawan
>>>> 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 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*
>
>
>
> --
> 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.
Re: [algogeeks] Tejas networks
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
wrote:
> q4) floyds algorithm for shortest path .
>
>
> On Sun, Sep 4, 2011 at 5:41 PM, sukran dhawan 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 wrote:
>>
>>>
>>>
>>> -- Forwarded message --
>>> From: sukran dhawan
>>> 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 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*
--
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] Tejas networks
q4) floyds algorithm for shortest path .
On Sun, Sep 4, 2011 at 5:41 PM, sukran dhawan 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 wrote:
>
>>
>>
>> -- Forwarded message --
>> From: sukran dhawan
>> 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 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.
Re: [algogeeks] Tejas networks
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 wrote:
>
>
> -- Forwarded message --
> From: sukran dhawan
> 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 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.
Re: [algogeeks] Tejas networks
Q3 -
possible approaches -
if the tree is simply - i think we need to store two traversals inorder and
preorder in file.
otherwise in case of BST preorder traversal is sufficient to recreate the
tree.
for general tree - do a breadth first traversal and for each node next to it
put its parent value (assuming repeated values not allowed in tree). while
recreating the tree read two values at a time from file and attach the node
to its parent.
On Sun, Sep 4, 2011 at 2:54 PM, sukran dhawan wrote:
>
>
> -- Forwarded message --
> From: sukran dhawan
> 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 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.
>
--
*MOHIT VERMA*
--
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.
Fwd: [algogeeks] Tejas networks
-- Forwarded message --
From: sukran dhawan
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 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.
Re: [algogeeks] Tejas networks
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 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.
Re: [algogeeks] Tejas networks
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.
Re: [algogeeks] Tejas networks
answer 2. 1. start from root. 2. mark it current. 3. save it in temp1 and current->next in temp2; 4. go to (current->next)->next; 5. now make temp2 point to temp1. 6. repeat till the linked list is not fully traversed 7.* make some restriction for first and last node;* 8. the linked list is now reversed. Time complexit O(n). -- 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] Tejas networks
Please tell most efficient algo 1. Write a method to find the prime fibonacci numbers. eg. 1,1,2,3,5,8,13 are fibonacci 2,3,5,7,11,12... are prime. 2,3,5,13.are prime fibonacci. 2. Write a program to reverse a linked list using O(1) space. 3. Write the traversal of a tree into a file and then recreate the tree using the file. 4. There is a matrix where a[i][j] =-1 if there is no train going from i station to j station. = 0 if i=j. = n if there is a train going from station i to j taking n hours. Given a starting station and destination station, find the minimum possible path from s to d. -- **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.
Re: [algogeeks] Tejas networks
thanks dheeraj...and yeah u r correct..:) On Sat, Aug 27, 2011 at 11:54 PM, Dheeraj Sharma < dheerajsharma1...@gmail.com> wrote: > its still to come in our college..but u can go through this link..i hope it > wud help u.. > > http://sameerbsws.blogspot.com/2010/12/latest-tejas-networks-placement-papers.html > coz i thnk..u r frnd of one of mah close frnd ;) > > On Sat, Aug 27, 2011 at 11:45 PM, Kamakshii Aggarwal < > kamakshi...@gmail.com> wrote: > >> can anyone tell about tejas networks recruitment procedure? >> and also what topics are being asked? >> >> -- >> Regards, >> Kamakshi >> kamakshi...@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. >> > > > > -- > *Dheeraj Sharma* > Comp Engg. > NIT Kurukshetra > +91 8950264227 > > -- > 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, Kamakshi kamakshi...@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.
Re: [algogeeks] Tejas networks
its still to come in our college..but u can go through this link..i hope it wud help u.. http://sameerbsws.blogspot.com/2010/12/latest-tejas-networks-placement-papers.html coz i thnk..u r frnd of one of mah close frnd ;) On Sat, Aug 27, 2011 at 11:45 PM, Kamakshii Aggarwal wrote: > can anyone tell about tejas networks recruitment procedure? > and also what topics are being asked? > > -- > Regards, > Kamakshi > kamakshi...@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. > -- *Dheeraj Sharma* Comp Engg. NIT Kurukshetra +91 8950264227 -- 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] Tejas networks
can anyone tell about tejas networks recruitment procedure? and also what topics are being asked? -- Regards, Kamakshi kamakshi...@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.
[algogeeks] Tejas networks and MAQ
Hi if anyone recently faced written or interview of those companies then pls discuss here Thanks in advance -- **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.
[algogeeks] Tejas Networks - Written Test
This was asked by Tejas Networks during campus recruitment in written test . 1) Given a matrix m[i][j] = distance traveled to go from i_th station to j_th station .WAC to find the minimum distance traveled to go from 0_th station to n_th station. 2) How will you store a tree in a file and then regenerate it .WAC for it . Except these there were questions on OS , Networking , error finding and output . -- 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.
