Answer Posted / jamshed

SHORTEST BINARY SEARCH PROGRAM


import java.io.*;
class Binary
{
public static void main()throws IOException
{
InputStreamReader isr=new
InputStreamReader(System.in);
BufferedReader br=new BufferedReader(isr);
int a[]={5,7,9,11,15,20,30,45,89,97};
int n,c=0,l=0,u=9,m;

System.out.println("Enter a Number to Search");
n=Integer.parseInt(br.readLine());
while(u>l)
{
m=(l+u)/2;
if(a[m]==n)
{
c++;
break;
}
else if(a[m]>n)
u=m;
else if(a[m]<n)
l=m+1;
}
if(c==0)
System.out.println("Not Found");
else
System.out.println("Found");
}
}

What is unmodifiable list?

1028

---

Why hashmap is faster than hashtable?

1076

---

Why is the isempty() member method called?

1096

---

Parenthesis is never required in postfix or prefix expressions, why?

957

---

What is entryset in hashmap?

960

---

List the applications of set adt?

957

---

What do you mean by the term “percolate up”?

988

---

Explain the most efficient method to reverse a linked list?

904

---

What is data structure? Explain.

1042

---

Define leaves?

1115

---

Which interfaces are implemented by abstractsequentiallist?

950

---

Can we give size to arraylist?

1011

---

Difference between calloc and malloc ?

994

---

How do you replace an element in an arraylist?

1058

---

Does arraylist allow null values?

1002

---