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 collision in hashing?

914

---

How remove all from arraylist?

936

---

Why is hashmap faster than treemap?

910

---

which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?

1016

---

What is the difference between list, set and map?

985

---

Can arraylist contain null?

843

---

Define double hashing?

946

---

How to sort 1 million floating point numbers?

1185

---

Does linked list allow null values?

820

---

How do signed and unsigned numbers affect memory?

886

---

Can we add elements to final list?

911

---

What are the tasks performed during preorder traversal?

1152

---

Define Data Structures?

970

---

What is mean by abstract data type?

989

---

What is difference between map and hashmap?

1024

---