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

How many digits can a float hold?

957

---

What is equlas() and hashcode() contract in java? Where does it used?

1073

---

Give any two differences between C++ and java.

1095

---

What is the difference between jdk and jre?

1014

---

How to change the priority of thread or how to set the priority of thread?

997

---

What is a programming object?

1028

---

What is a bubble sort in java?

909

---

What is method overloading with type promotion?

1223

---

What is the static field modifier?

1072

---

What are exception handling keywords in java?

989

---

How dead lock situation occurs in java and how you can identify it?

950

---

Can we store variables in local blocks?

1312

---

What is purpose of keyword void?

990

---

What package is math in java?

959

---

Can we override protected method in java?

1004

---