Can you dynamically allocate arrays in expanded memory?
- 0 Answers
- 622 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
How will inorder, preorder and postorder traversals print the elements of a tree?
What is the use of threaded binary tree?
What is unbounded queue?
Can an arraylist be null?
Define ancestor and descendant ?
When ArrayIndexOutOfBoundsException occurs?
What does arraylist remove do?
What is minimum depth of binary tree?
What is the complexity of selection sort?
What is sorted map?
What is raid (redundant array of inexpensive disks)?
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.
Windows 
