Linear probing is equivalent to double hashing with a secondary hash function of

Question

Linear probing is equivalent to double hashing with a secondary hash function of h2(k)-1 1. True False 2. An algorithm with worst case time behavior of 3n takes at least 30 True False operations for every input of size n-10 3. Building a heap from an array of N items requires O(N log N) time.True False 4. For large input sizes, merge sort will always run faster than insertion sort True False 5. It is possible for a member function of a class to activate another member True False 6. Friend functions of the class can access private member variables of a True False 7. Suppose that the bag is implemented with a linked list. The insertion True False 8. When a function changes *p, and we want the change to affect the object True False on the same input). function of the same class. class. operation is likely to have a constant worst-case time that is pointed at. So we should set the pointer parameter p be a reference parameter 9. True False The implementation of copy constructor is the same as the implementation of an overloaded assignment operator. 10. In the array version of the stack class (with a fixed-sized array), push True False operations require linear time at worst-case.

Explanation / Answer

As per Chegg policy, I am answering only first 4 questions. In order to get the solution of remaining questions, please upload them again.

1.) True.

2.) False. As it will take at most 30 operations, not at least 30 operations.

3.) False. Building a heap will take O(n) time.

4.) False. As in best case insertion sort runs in O(n) while merge sort will run in O(n log n) time,

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.