Answer Posted / kaustubh

I'll give the algo here.You may write it in a programming
language of your choice.

Iterative Algo:

node *Reverse(node *head)
{
node *p,*q,*r;
p=head;q=r=NULL;
while(p!=NULL)
{
q=p;
p=p->next;
q->next=r;
r=q;
}
head=q;
return head;
}

Recursive algo:

From main call: Reverse(node *head,NULL)

reverse(node *p,node *q)
{
if(p->next!=NULL)
reverse(p->next,p)
else
{
p->next=q;
return
}
}

What is the constructor?

1049

---

Is it necessary that each try block must be followed by a catch block?

1014

---

What is the disadvantage of synchronization?

1007

---

What is the use of private static?

1045

---

Are constructors methods?

1003

---

What is the arraylist in java?

1040

---

What is the difference between a method and a procedure?

1059

---

What is overloading and overriding in java?

1218

---

What is the meaning of I ++ in java?

1172

---

Define jit compiler?

1130

---

What is method in java ?

1073

---

What is jrmp?

960

---

What is a condition in java?

997

---

Is string a class?

1021

---

I want my class to be developed in such a way that no other class (even derived class) can create its objects. How can I do so?

978

---