Gate Exam

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?

Option
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)

Read Solution (Total 0)

Gate Other Question

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero(the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

Option
(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
(C) This algorithm is equivalent to the shortest-job-first algorithm.
(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm. The smallest integer than can be represented by an 8-bit number in 2's complement form is

Option
(A) -256
(B) -128
(C) -127
(D) 0