Interview Questions and Answers for 'Binary' | Search Interview Question

Interview Questions and Answers for 'Binary' - 12 question(s) found - Order By Newest

Advanced level question frequently asked in US based companies. Recently asked in EMC and Intuit.

Q1. Can you provide some implementation of a Dictionary having large number of words ?

Ans. Simplest implementation we can have is a List wherein we can place ordered words and hence can perform Binary Search.

Other implementation with better search performance is to use HashMap with key as first character of the word and value as a LinkedList.

Further level up, we can have linked Hashmaps like ,

hashmap {
a ( key ) -> hashmap (key-aa , value (hashmap(key-aaa,value)
b ( key ) -> hashmap (key-ba , value (hashmap(key-baa,value)
....................................................................................
z( key ) -> hashmap (key-za , value (hashmap(key-zaa,value)
}

upto n levels ( where n is the average size of the word in dictionary.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve java collections hashmap binary search search algorithm advanced architecture data structure Asked in 6 Companies frequent}

Try 1 Question(s) Test

Q2. What are the pre-requisite for the collection to perform Binary Search ?

Ans. 1. Collection should have an index for random access.
2. Collection should have ordered elements.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve java collections search algorithm search binary search at&t intermediate}

Q3. What is a binary tree ?

Algorithm

Ans. Binary tree is a tree in which each node has up to two children.Tree is a data structure composed of nodes.Each tree has a root node(not necessary in graph theory). The root node has zero or more child nodes.Each child node has zero or more child nodes, and so on.The tree cannot contain cycles.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve binary tree Asked in 1 Companies}

Q4. What is the difference between >> and >>>?

Ans. Both bitwise right shift operator ( >> ) and bitwise zero fill right shift operator ( >>> ) are used to shift the bits towards right. The difference is that >> will protect the sign bit whereas the >>> operator will not protect the sign bit. It always fills 0 in the sign bit.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve java operators bitwise operators binary shift right shift}

Q5. Write a method to convert binary to a number ?

Core Java

Ans.
convert(int binaryInt) {
   int sumValue=0;
   int multiple = 1;
   while(binaryInt > 0){
      binaryDigit = binaryInt%10;
      binaryInt = binaryInt /10;
      sumValue = sumValue + (binaryDigit * multiple);
      multiple = multiple * 2;
   }
   return sumValue;
}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve java binary interesting question coding}

Q6. Can we use Ordered Set for performing Binary Search ?

Ans. We need to access values on the basis of an index in Binary search which is not possible with Sets.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve java sets set collections binary search}

Frequently asked to Fresh graduates.

Q7. Write a program to implement Binary search ?

Core Java

Ans. http://algs4.cs.princeton.edu/11model/BinarySearch.java.html

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve binary search search Asked in 5 Companies basic frequent}

Try 1 Question(s) Test

Q8. Write code to check if a Binary tree is symmetrical

Algorithm

^{This question was recently asked at 'Amazon'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve binary tree Asked in 1 Companies}

Q9. How Cassandra provides better Read performance than Oracle Indices ?

Database

Ans. Cassandra uses Hash Search which provides a look time of O(1) whereas Oracle Indices uses Binary Search that provide a lookup time of O(Log n).

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve cassandra hash search hash search vs binary search}

Q10. Explain Binary Search

Algorithm

^{This question was recently asked at 'Nagarvision'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve search binary search Asked in 1 Companies basic frequent}

Q11. What are the disadvantages of binary search trees?

Algorithm

^{This question was recently asked at 'ServiceNow'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve binary search tree Asked in 1 Companies}

Q12. Class and Object methods.

Core Java

Ans. class:- A class describe the contents of an object, an it describe the detail of data field called instance variable and defines the operations called method.

Object:-An object is an element of a class. Object have the behaviors of their class.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q13. Binary Search requires that the collection should be Reference

Algorithm

a. Sorted in Ascending Order

b. Sorted in Descending Order

c. Sorted in any Order

d. Unsorted

Ans.c. Sorted in any Order

Search Interview Questions

Help us and Others Improve. Please let us know the questions asked in any of your previous interview.