Answer Posted / siya

#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],n,i,j,temp;
printf("\n\nEnter the total number of eleents:");
scanf("%d",&n);
printf("\n\nEnter the array elements:");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
/* sorting */
for(i=0;i<n;i++)
{
for(j=i;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
}
printf("\n\nThe sorted array:");
for(i=0;i<n;i++)
printf("%d ",a[i]);
}

Define an algorithm.

983

---

Define an abstract data type (adt)?

977

---

What is difference between arraylist and linkedlist?

1047

---

Write a program to sum values of given array.

1035

---

Is a hash table a map?

1025

---

What is difference between hashset and treeset?

1059

---

“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?

1202

---

Differentiate between hashmap and treemap.

976

---

What are the Difference between tcp and udp?

1000

---

How can someone display singly linked list from first to last?

862

---

What is bubble sort with example?

935

---

What are red-black trees?

1008

---

Provide an algorithm to reverse a linked list without using recursion.

944

---

How to create your own data structure in java?

931

---

What are the advantages of binary search over linear search?

1043

---