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 a Breadth First Search? Give a few of its applications.

838

---

What data structure underlies a python list?

891

---

What is a hash in programming?

856

---

Which is better than array and linked list?

883

---

Explain the term binding time?

878

---

What do u mean by array?

873

---

Explain what are the major data structures used in the network data model?

989

---

What is the difference between hashset and linkedhashset?

936

---

What is merge sort and how it works?

789

---

Define non linear data structure.

919

---

Is hashtable fail fast?

788

---

What exactly is a thread?

856

---

What is difference between rb tree and avl tree?

833

---

Can we remove element from arraylist while iterating?

903

---

Is array a data type?

809

---