Interested to Buy Any Domain ? << Click Here >> for more details...
What is the minimum number of nodes that a binary tree can have?
- 0 Answers
- 1214 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.
Explain about circular linked list?
How to find if linked list has loop?
Write a code for dynamic allocation of array.
Why quicksort is better than merge sort?
What is the best complexity of bubble sort?
Why is hashmap faster than treemap?
What is an array vs list?
Why is merge sort faster?
What is bubble sort?
Explain the priority queue?
What is data type in data structure?
Windows 
