Answer Posted / arnoldindia

#include<conio.h>
#include<iostream.h>
#include<process.h>

int binarysearch(int list[], int end, int target, int &locn)
{
int first=0, mid, last=end;
while(first<=last)
{
mid=(first+last)/2;
if(target>list[mid])
first=mid+1;
else if(target<list[mid])
last=mid-1;
else
break;
}
locn=mid+1;
return(target==list[mid]);
}

void main()
{
int a[10],i,s=0,n,loc,flag=0;
clrscr();
cout<<"\n Enter the no. of element to store:\n";
cin>>n;
cout<<"Enter the Elements:\n";
for(i=0;i<n;i++)
cin>>a[i];

cout<<"\n The Elements are:\n";
for(i=0;i<n;i++)
cout<<a[i]<<"\t";

cout<<"\n Enter the Element to search:\n";
cin>>s;

if(binarysearch(a,n,s,&loc))
cout<<"\nThe element "<<s<< " is available at location
"<<loc<<endl;
else
cout<<"\nThe element "<<s<< " is not found in the List"<<endl;


}

Define linear data structures?

991

---

Can you please explain the difference between string and an array?

1115

---

Can you list out the areas in which data structures are applied extensively?

1006

---

Can treemap key null?

1024

---

What are types of Collision Resolution Techniques and the methods used in each of the types?

1073

---

How to find the missing element in integer array of 1 to 7?

942

---

What is the order of selection sort?

802

---

What is the use of treemap?

936

---

What is a stable sort?

852

---

Does arraylist guarantee insertion order?

899

---

What does enum do?

898

---

Is binary tree a binary search tree?

834

---

Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?

887

---

How many types of search algorithms are there?

875

---

What is the advantage of the heap over a stack?

997

---