Assume that a priority queue is implemented using a binary heap and contains n items. what is the average time requirement for the insert () operation? (2) a) o(1) b) o(log n) c) o(n) d) o (n log n) e) o (n2)

Given the following code: if (n == 2) { k -= 2; } else if (n == 3) { k -= 3; } can be rewritten as: if (< condition > ) { < assignment statement > ; } assume that evaluating < condition > does not change the values stored in n and k. which of the following could be used as < assignment statement > ? k -= n; k -= 1; k -= 2; k += n; k = n - k;

Idon understand these and need some ! ?

Two technicians are discussing the common u-joint. technician a says its input and output speeds should be equal. technician b says that it normally has two yokes. which technician is correct?