Solution - Interview Questions and Answers for 'Search algorithm' | Search Interview Question

Solution - Interview Questions and Answers for 'Search algorithm' - 4 question(s) found - Order By Rating

Q1. How different is the Search algorithm when we query Cassandra Tables and When we query Oracle Tables ?

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 :

_{Like Discuss Correct / Improve cassandra vs oracle nosql vs relational search algorithm}

Q2. Explain various Searching and Sorting Algorithms ?

Algorithm

^{This question was recently asked at 'HeadStrong,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 Search Algorithm Sorting Algorithm Asked in 2 Companies basic frequent}

Q3. 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}

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

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

Solution

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

Search Interview Questions

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