Interested to Buy Any Domain ? << Click Here >> for more details...
Which searching algorithm is best?
- 0 Answers
- 888 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Which sorting algorithm has minimum number of swaps?
I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.
List some applications of multilinked structures?
How does linkedhashset work internally?
Do you know what is linear search?
When is a graph said to be weakly connected?
What is a dequeue?
What are control structures?
create an singly linked lists and reverse the lists by interchanging the links and not the data?
What is difference between hashmap and hashset?
What is a reverse linked list.
What is mergesort and hashtable?
Windows 
