Data structure multiple choice questions and answers with explanation. 1) The average search time of hashing with linear probing will be less if the load factor ? is far less than oneequals oneis far greater than oneNone of aboveShow/Hide Answer Answer = A Explanation: No Explanation2) The complexity of binary search algorithm is ? nnlognlognn2Show/Hide Answer Answer = D Explanation:N/A3) The
No comments:
Post a Comment