Reverse a linked list from the middle.
No Answer is Posted For this Question
Be the First to Post Answer
Explain the internal working of a hash map?
There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
Write a program to sum values of given array.
Does treeset allow null values?
What is top in stack?
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 collections singletonlist?
What is a spanning tree in data structure?
What is bubble sort?
Which interfaces are implemented by printerstatereasons?
Explain the term recursive case?
How does a treemap sort?