Answer Posted / nitin jatpuriya

//PROGRAM FOR BUBBLE SORT

#include<stdio.h>
#include<conio.h>
#define SIZE 5
void main()
{
int a[SIZE],n,i,j,temp;
clrscr();
printf("enter the elements ");
for(i=0;i<SIZE;i++)
scanf("%d",&a[i]);
printf("the sorted list is :->\n");
for(i=0;i<SIZE;i++)
for(j=i;j<SIZE-i;j++)
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}

for(i=0;i<SIZE;i++)
printf("%d",a[i]);
getch();
}

What is the maximum size of array?

924

---

How is the front of the queue calculated in data structure?

866

---

Does arraylist have index?

957

---

Explain circular linked list?

928

---

What is the meaning of anonymous array? Explain with an example?

1197

---

What is variable size arrays?and why we use it?

1022

---

Does arraylist extend list?

929

---

What is a subtree?

971

---

Is treemap sorted?

958

---

What is an object array?

941

---

How does quicksort partition work?

966

---

Difference between hashset and treeset?

1054

---

Define terminal nodes in a tree?

1037

---

Describe tree database.

894

---

Define shortest path?

1044

---