Algorithm Analysis
How does the height of a binary search tree grow, compared to the number of nodes in the tree?
a) Always linear
b) Always logarithmic
c) Linear only if the tree is balanced
d) Logarithmic only if the tree is balanced
e) None of the above
Algorithm Analysis -
Which of the following sorting algorithms is the least dependent on the initial ordering of the input, in terms of the algorithm's running time?
a) Insertion Sort
b) Quicksort
c) Merge Sort
d) Selection Sort
e) Shell Sort
Probability -
P speaks truth in 85% of the cases and Q in 70% of the cases. What is the percentage of cases in which they are likely to contradict each other in stating the same fact?
a) 20%
b) 24%
c) 36%
d) 42%
e) None of these
.
欢迎来到华新中文网，踊跃发帖是支持我们的最好方法!
War is peace.
Freedom is slavery.
Ignorance is strength.
