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

Explain the uses of b+ tree.

914

---

State the demerits of linked representation of binary trees?

921

---

What does stack top do?

888

---

What is a pseudocode example?

960

---

List the data structures which are used in rdbms.

859

---

What do you mean by complexity of search algorithm?

722

---

Explain quick sort and merge sort algorithms.

955

---

What are sorting algorithms used for?

964

---

Does hashmap maintain insertion order?

911

---

What is a tech stack?

859

---

What is difference between static and dynamic array?

933

---

What is unbounded queue?

913

---

Is priority queue sorted?

951

---

Can treeset contain null?

878

---

What is bitonic search?

942

---