Interested to Buy Any Domain ? << Click Here >> for more details...
Define a binary search tree?
- 0 Answers
- 951 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
How to print element of Array?
What is the advantage of the heap over a stack?
What do you mean by breadth first search (bfs)?
Is there any difference between int[] a and int a[]?
Define path in a graph?
How many sorting algorithms are there?
How does a heap sort work?
What is the easiest sorting method to use in data structures?
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 concept of data structure?
How do you solve a selection sort?
What is the difference between Array and Array List ? Explain in brief with example.
Windows 
