Company: Tescra MCQ
Difficulty: medium
Which of the following properties are not expected out of a well-designed hash function? Hash function should be easy to compute Hash function should spread out most data sets The hash function should spread out every data set The hash function should be easy to store Consider a directed graph G with distinct and non-negative edge lengths and a source vertex S. Which of the following statements about a fixed destination vertex T, assuming that the graph contains at least one S-T path, is/are true? The shortest S-T path must exclude the maximum-length edge of G. The shortest S-T path must include the minimum-length edge of G. All of the given options The shortest S-T path might have as many as n-1 edges, where n is the number of vertices. Given a binary tree with n nodes, how long does it take, in the worst case, to check if it is a binary search tree? Note: Choose the tightest upper bound. O(logn) O(height) O(n) O(nlogn) Which of the following declarations is/are true for array? All of