Is binary tree balanced?
Define heap?
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.
Define rehashing?
How does bogo sort work?
Write a data structure for a queue.
0 Answers Tavant Technologies, Zensar,
Why do we use hashmap?
List some applications of queue data structure.
What are the parts of a linked list?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Can map contain duplicate keys?
What is the minimum number of queues that can be used to implement a priority queue?
Is complete binary tree?