What should I learn first data structures or algorithms?
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.
When is a graph said to be weakly connected?
Tell me real world example of polymorphism and encapsulation .
Does stringutils isempty check for null?
What is heap tree in data structure?
How many passes are required in bubble sort?
Evaluate the following prefix expression " ++ 26 + - 1324"
24 Answers College School Exams Tests, Patni,
Why we use linked list?
Which is the best book for data structures and algorithms?
How do treesets work internally?
Define hash table?
What is hashing in cyber security?