Which is better array or linked list?
What is the basic of data structure?
Does treeset remove duplicates?
How can you represent a linked list node?
What is max heapify?
Why is hashing used?
How can you add an item to the beginning of the list?
What is vector and types of vector?
Why is reflection slower?
Are duplicates allowed in list?
Define back edge?
Can hashmap be sorted?
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.