Answer Posted / rahul awasthi

Answer
# 1 #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;


}

What is an ordered map?

962

---

Mention the data structures which are used in graph implementation.

925

---

Give the example of validating the parenthesis of expression using stack.

1087

---

What is bubble sort?

954

---

Which is the parent class of sortedset class?

1055

---

What are the disadvantages of linked list over array?

947

---

Why set will not allow duplicates?

942

---

Name few concurrent collection classes?

958

---

Is linked list faster than array?

899

---

What does it mean to sort an array?

1059

---

How do you find the second largest element in an array of integers?

1122

---

How efficient is binary search?

912

---

Name some applications which use linked lists.

1043

---

Why null is allowed in hashmap?

921

---

How to sequentially represent max-heap?

965

---