|
Search Interview Questions |  3332 questions in repository. There are more than 200 unanswered questions. Click here and help us by providing the answer. Have a video suggestion. Click Correct / Improve and please let us know. |
|
|||
| |||||||||||||||||||||||||||
| Interview Questions and Answers for 'Search' - 11 question(s) found - Order By Newest | |||||||||||||||||||||||||||
 Advanced level question frequently asked in US based companies. Recently asked in EMC and Intuit. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| 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 : | |||||||||||||||||||||||||||
 Discuss Correct / Improve  java collections hashmap binary search search algorithm advanced architecture data structure  Asked in 6 Companies  frequent | |||||||||||||||||||||||||||
 Try 1 Question(s) Test | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| 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 : | |||||||||||||||||||||||||||
Discuss Correct / Improve java collections search algorithm search binary search at&t  intermediate | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| 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 : | |||||||||||||||||||||||||||
| Discuss Correct / Improve java sets set collections binary search | |||||||||||||||||||||||||||
| Frequently asked to Fresh graduates. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| 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 : | |||||||||||||||||||||||||||
| Discuss Correct / Improve binary search search Asked in 5 Companies basic frequent | |||||||||||||||||||||||||||
| Try 1 Question(s) Test | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| Ans. Spring Boot is Springs convention-over-configuration solution for creating stand-alone, production-grade Spring-based Applications. | |||||||||||||||||||||||||||
| Help us improve. Please let us know the company, where you were asked this question : | |||||||||||||||||||||||||||
| Discuss Correct / Improve Spring Boot Asked in 7 Companies | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| Ans. Maven is a build automation tool used primarily for Java projects. | |||||||||||||||||||||||||||
| Help us improve. Please let us know the company, where you were asked this question : | |||||||||||||||||||||||||||
| Discuss Correct / Improve maven build Asked in 6 Companies basic frequent | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| Ans. public class BuggyBread { public static void main(String args[]) { System.out.println(factorial(5)); } private static int factorial(int number){ if(number == 1){ return 1; } else { return number * factorial(number - 1); } } } | |||||||||||||||||||||||||||
| Help us improve. Please let us know the company, where you were asked this question : | |||||||||||||||||||||||||||
| Discuss Correct / Improve recursion Asked in 24 Companies | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| 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 : | |||||||||||||||||||||||||||
| Discuss Correct / Improve cassandra hash search hash search vs binary search | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| Ans. Relational Database uses linear search if we don't query using indices. Performance for linear search is O(n). If indices have been used , relational database uses binary search. Performance for binary search is O(Log n). Casandra uses hash search. Performance for Hash Search is O(1). | |||||||||||||||||||||||||||
| Help us improve. Please let us know the company, where you were asked this question : | |||||||||||||||||||||||||||
| Discuss Correct / Improve cassandra vs oracle nosql vs relational 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 : | |||||||||||||||||||||||||||
| Discuss Correct / Improve search binary search Asked in 1 Companies basic frequent | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
Binary Search requires that the collection should be
Reference