t; 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:
> >>>>
> >
t;
>>>> 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:
>>>>
>>>>>
&g
awan 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:
ran 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:
>>>
>>>>
>>>>
>&
n 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@google
t;>
>> -- 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(st
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:
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
-- 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 != n
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 Ghat
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...@googlegroup
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 re
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 tre
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-
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 tel
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@goog
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 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 re
18 matches
Mail list logo
