Answer Posted / sumit garg( jmit mca)

\\HELLO FRIENDS CHEK THIS...IT IS TESTED\\
struct node
{
int info;
struct node * next;
};
struct node * ptr=NULL,* old=NULL,*save=NULL;
void reverse()
{
old=ptr=start;
while (ptr!=NULL)
{
ptr=ptr->next;
old->next=save;
push(old);
save=old;
old=ptr;
}
}
void push(struct node * p)
{
top++;
stack [top]=p;
}
struct node * pop()
{
struct node * ret=NULL;
ret=stack[top];
top=top-1;
return ret;
}
display(struct node * disp)
{
disp=stack[top];
while (disp->next!=NULL)
{
disp=pop();
printf("%d",disp->info);
}

Which sort algorithm is best?

842

---

What is the application of queue?

854

---

Define root?

912

---

Which are the sorted collections?

896

---

What is the best complexity of bubble sort?

850

---

State the merit of linked representation of binary trees?

878

---

Is python good for freshers?

931

---

Why quicksort is faster?

805

---

What are the advantages of bubble sort?

910

---

Does mentioning the array name gives the base address in all the contexts?

1308

---

Do all declaration statements result in a fixed reservation in memory?

871

---

Which is faster array or linked list?

841

---

What is hashing with example?

881

---

which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?

964

---

Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?

896

---