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 sorting algorithm has minimum number of swaps?

852

---

Which sorting is best for large data?

887

---

Are dictionaries mutable?

826

---

Define adjacent nodes?

990

---

Is vector synchronized?

876

---

What are the disadvantages of circular list?

923

---

What is a minimum spanning tree?

1017

---

How is a queue works?

918

---

What is the minimization factor and time complexity of b-tree?

1085

---

What is array traversing?

855

---

Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

891

---

What is circular linked list?

912

---

What is mean by merge sort?

843

---

How expression trees are gets represented in data structure?

833

---

Is it possible to make an array volatile in java?

869

---