:54 PM, sukran dhawan sukrandha...@gmail.comwrote:
-- 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
: [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
, 2011 at 2:54 PM, sukran dhawan
sukrandha...@gmail.comwrote:
-- 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
On Sun, Sep 4, 2011 at 2:54 PM, sukran dhawan
sukrandha...@gmail.comwrote:
-- 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
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
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
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
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
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
-- 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
...@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
: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
...@gmail.comwrote:
-- 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
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
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
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..
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
17 matches
Mail list logo