Answer Posted / saisharath

#include<stdio.h>
#include<conio.h>
int nr_bin_search(int[],int,int);
void main()
{
int key,i,n,index,l[20];
printf("\n enter the number of elements in the list:");
scanf("%d",n);
printf("\n enter the elements of the list:");
for(i=0;i<n;i++)
scanf("%d",&l[i]);
printf("\n enter the key element to be searched in the
list:");
scanf("%d",&key);
index=nr_bin_search(l,n,key);
if(index==-1)
printf("\n search completed,element%d found in the list at
position %d",key,index);
getch();
}
int nr_bin_search(ints[],int n,int e)
{
int low_val,mid_val,high_val;
low_val=0;
high_val=0;
while(high_val>=low_val)
{
mid_val=(low_val+high_val)/2;
if(s[mid_val]==e)
return(mid_val);
if(s[mid_val]<e)
low_val=mid_val+1;
else
high_val=mid_val-1;
}
return-1;
}

What is the difference between 1d and 2d array?

986

---

What is the use of prototype?

912

---

Are the expressions arr and &arr same for an array of integers?

1005

---

What is modcount in hashmap?

891

---

Define dynamic data structures?

1028

---

Why null is allowed in hashmap?

883

---

What is bubble sort algorithm?

972

---

Explain pre-order and in-order tree traversal.

951

---

Why we need cursor implementation of linked lists?

999

---

What is data and its type?

1034

---

Mention for which header list, you will found the last node contains the null pointer?

849

---

List the area of applications where stack data structure can be used?

917

---

What is the difference between hashset and arraylist?

986

---

Is hashmap get thread safe?

868

---

Define the queue data structure.

1052

---