Interested to Buy Any Domain ? << Click Here >> for more details...
Is hashset thread safe?
- 0 Answers
- 983 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is time complexity of arrays sort?
Which is faster hashmap or hashset?
Which sorting has less time complexity?
Define a priority queue?
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.
What is binary search tree and explain its time complexity?
What do you know about different sorting algorithms?
Explain the steps to insert data into a singly linked list?
What is the height of binary tree?
Which is better hashmap or hashtable?
What is a queue in data structure?
What do you mean by back edge?
Windows 
