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

write a program to accept name & sort them?

902

---

What is the difference between hashmap and linkedhashmap?

917

---

State the difference between primitive and non-primitive data types?

1147

---

List the basic operations carried out in a linked list?

1026

---

Does linkedhashset allow null values?

984

---

What happens if we try to insert duplicate key in hashmap?

806

---

What is a data structure? What are the types of data structures? Briefly explain them

955

---

What is the difference between arraylist and linkedlist?

982

---

How do you reference all the elements in a one-dimension array?

1029

---

Mention a few applications of linked lists?

920

---

What are different methods of collision resolution in hashing.

942

---

Is array part of collection framework?

896

---

Write is a binary search tree? Write an algorithm and tell complexity?

895

---

What is list and its types?

887

---

What is data structure geeksforgeeks?

1284

---