Interested to Buy Any Domain ? << Click Here >> for more details...
Is python good for freshers?
- 0 Answers
- 976 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
How to copy an array into another array?
How does hashset maintain order?
What is a treeset?
Is hashtable better than dictionary?
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 best case time complexity of bubble sort?
What is data structure and why we need them?
What is a stable algorithm?
Define ancestor and descendant ?
What is the difference between hashmap and treemap?
Can arraylist have duplicates?
What is adt example?
Windows 
