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 java regex?

1057

---

What is the difference between iterator and list iterator?

1097

---

What is an example of a constant variable?

1146

---

What is map and hashmap in java?

1117

---

What is ordered map in java?

1060

---

What's the access scope of protected access specifier?

1096

---

Why synchronization is important?

1071

---

What is a method header?

1073

---

Explain why wait(), notify() and notifyall() methods are in object class rather than in thread class?

1057

---

What is the base class for error and exception?

1037

---

What are the kinds of polymorphism?

1125

---

What are the drawbacks of reflection?

1059

---

What is the indent key?

1087

---

Can we create object of inner class in java?

996

---

How do I get 64 bit java?

1212

---