Can a class have a constructor?
No Answer is Posted For this Question
Be the First to Post Answer
How do you find the complexity of a selection sort?
Explain different methods in which you can traverse a tree?
Define back edge?
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.
Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topological order and then apploy the fact that every vertex must come before its successors in the topolgical order.
Is binary tree balanced?
What are lists?
Is hashset thread safe?
Write a program using mergesort technique.
What are the applications of linked list?
What are the drawbacks of array implementation of queue?
What are the four types of variables?