Interested to Buy Any Domain ? << Click Here >> for more details...
Define static data structures?
- 0 Answers
- 931 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.
What is array traversing?
Explain what is linear search?
What is the difference between set and unordered_set?
Where is insertion sort used?
Which data structures are applied when dealing with a recursive function?
What is the difference between length () and size () of arraylist?
What do you mean by separate chaining?
What is meant by linked list?
Define adjacent nodes?
What is the difference between a Stack and a Queue.
What is the use of data structure in real life?
Windows 
