Why is sorting necessary?
Does list allow null values?
How many types of sorting algorithms are there?
Which type of memory allocation is referred for linked list?
How does a selection sort work?
Is merge sort better than quick?
How does arraylist store data?
Is pointer a variable?
How would you reverse characters of an array without using indexing in the array.
Which is faster binary or linear search?
What is difference between an Array and ArrayList?
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 a spanning tree in data structure?