Answer Posted / shah varshil

#include<stdio.h>

main()
{
int c, first, last, middle, n, search, array[100];

printf("Enter number of elements\n");
scanf("%d",&n);

printf("Enter %d integers\n", n);

for ( c = 0 ; c < n ; c++ )
scanf("%d",&array[c]);

printf("Enter value to find\n");
scanf("%d",&search);

first = 0;
last = n - 1;
middle = (first+last)/2;

while( first <= last )
{
if ( array[middle] < search )
first = middle + 1;
else if ( array[middle] == search )
{
printf("%d found at location %d.\n", search, middle
+1);
break;
}
else
last = middle - 1;

middle = (first + last)/2;
}
if ( first > last )
printf("Not found! %d is not present in the list.\n",
search);

return 0;
}

Define primary clustering?

985

---

Explain stacks and queues in detail.

1190

---

Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?

1012

---

Describe queue operation.

1030

---

What is the difference between a push and a pop?

1018

---

Which sorting does collections sort use?

946

---

What is a multiset table?

908

---

What is the difference between Array and Array List ? Explain in brief with example.

1012

---

Which interfaces are implemented by abstractsequentiallist?

950

---

Can an arraylist be null?

963

---

How does quick sort work?

985

---

What is nsmutablearray?

897

---

State the difference between queues and linked lists?

1040

---

What is a treemap used for?

939

---

Write the c program to insert a node in circular singly list at the beginning.

940

---