Can we insert null in hashset?
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.
Is collection a class or interface?
How do you insert a new item in a binary search tree?
Can you change size of array once created?
Is array a data type?
Define non-linear data structures?
What do you mean by union-by-weight?
How can someone display singly linked list from first to last?
How do you define a set?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
Why is quicksort better than mergesort?
How do we search a specific element in an array?