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;
}

Why is data structure?

477

---

How do I start preparing for placement?

500

---

What is dynamic array how is it created?

470

---

What are the disadvantages of sequential storage?

734

---

Is array a data structure?

506

---

---

Explain what is the data structures used to perform recursion?

484

---

Is hashset a collection?

474

---

What is a hashmap in c?

493

---

Is copyonwritearraylist thread safe?

472

---

What is difference between concurrenthashmap and hashtable?

422

---

What is the top of a stack?

517

---

Define double linked list?

572

---

Explain what is the bucket size, when the overlapping and collision occur at same time?

583

---

What is the use of heap sort?

461

---

Which collection is used for sort?

502

---