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

Calculate the address of a random element present in a 2d array, given base address as ba.

1454

---

Define balancing condition for AVL Tree.

970

---

What does a bubble chart show?

840

---

When is a binary search best applied?

823

---

Explain the difference between hashset and hashmap?

1014

---

What are the two traversal strategies used in traversing a graph?

912

---

What is the difference between a stack and an array?

993

---

Does linked list allow duplicates?

827

---

Which is faster binary or linear search?

836

---

What is indexing an array?

951

---

What is the difference between length () and size () of arraylist?

842

---

Define heap?

996

---

How would you reverse the characters of an array?

873

---

Which data structures are used in bfs and dfs algorithm?

972

---

How do you clear a stack?

871

---