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
}
}

Explain the transient field modifier?

1049

---

What is meant by class?

1006

---

What is a method signature java?

1056

---

Is there a sort function in java?

971

---

Why main() method is public, static and void in java ?

1104

---

What is difference between module and function?

1187

---

What are new features introduced with java 8 ?

996

---

In which order the iterator iterates over collection?

996

---

What is the lifetime and scope of a variable?

1020

---

Can you make a constructor final?

1043

---

How do you compare two strings lexicographically?

935

---

What is the difference between overriding & overloading?

1073

---

What is the purpose of a volatile variable?

1066

---

What is a parameter in a function?

1000

---

Can abstract class have private constructor?

945

---