Interested to Buy Any Domain ? << Click Here >> for more details...
Why do we need to use computers to help us sort lists?
- 0 Answers
- 989 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.
What is the use of hashtable?
What do you mean by sorting data?
Which are the sorted collections?
How do you replace an element in an arraylist?
In what data structures are pointers applied?
What is the use of bubble sort?
Which process places data at the back of the queue?
What is complete binary tree and almost complete binary tree?
Does hashtable allow null values?
How to do the intersection of two sorted arrays?
What is data and data types?
Windows 
