Answer Posted / s.devudu

#include<stdio.h>
int binarysearchr(int a[],int,int,int);
void main()
{
int a[],i,j,b,n,key,temp;
clrscr();
printf("enter the n value");
scanf("%d",&n);
printf("enter the array values");
for(i=0;i<=n;i++)
scanf("%d",&a[i]);
for(i=0;i<=n;i++)
{
for(j=0;j<=n-1;j++)
{
if(a[j]>=a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
printf("in an array after sorting");
scanf(%d\t",&a[i]);
printf("enter the key value");
for(i=0;i<=n;i++)
scanf(%d",&key);
b=binarysearchr(int a[],int i,int n,int key);
if(b)
printf("location of key element is %d\n",b);
else
printf("key not found");
getch();
}
int binarysearchr(int a[],int low,int high,int key);
{
int mid;
if(low>high)
return 0;
mid=(low+high)/2;
if(key==a[mid])
return mid;
else if(key<=a[mid])
return binarysearchr(a,mid-1,high,key);
else
reurn binarysearch(a,low,mid+1,key);
}

Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.

829

---

Can you override methods of arraylist?

921

---

Can arraylist contain duplicates?

803

---

Can arraylist be resized?

940

---

Why null is allowed in hashmap?

820

---

Which type of memory allocation is referred for linked list?

1140

---

How to get largest and smallest number in an array?

937

---

Explain multiply linked list in short.

871

---

Why is null not allowed in concurrenthashmap?

846

---

What is binary search in programming?

837

---

Define the graph data structure?

902

---

What is a minimum spanning tree?

1005

---

Are duplicates allowed in list?

871

---

How can we reverse a singly linked list?

924

---

What are different techniques for making hash function?

861

---