Interested to Buy Any Domain ? << Click Here >> for more details...
What does it mean to sort an array?
- 0 Answers
- 1058 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
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.
Reverse a linked list from the middle.
What is a stable sorting algorithm?
What is perfect binary tree?
Why is reflection slower?
Tell me what should be done in the base case for this recursive problem?
Can we make hashmap synchronized?
How to inverting a function in sort and searching?
What is the best complexity of bubble sort?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
Can value be null in treemap?
What is a subtree in data structures?
Windows 
