Interested to Buy Any Domain ? << Click Here >> for more details...
Is hashtable better than dictionary?
- 0 Answers
- 939 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Tell me about circular linked list?
Why do we need to use computers to help us sort lists?
Which sorting algorithm is considered the fastest?
Define threaded binary tree. Explain its common uses
What happens if we put duplicate key in hashmap?
What is a property class?
What is binary search in programming?
Define a binary search tree?
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.
How would you reverse characters of an array without using indexing in the array.
Differentiate null and void?
What are the issues that hamper the efficiency in sorting a file?
Windows 
