Gate Exam

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.

Read Solution (Total 0)

Gate Other Question

Using public key cryptography, X adds a digital signature s to message M, encrypts , and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
(A) Encryption: X's private key followed by Y's private key; Decryption: X's public
key followed by Y's public key
(B) Encryption: X's private key followed by Y's public key; Decryption: X's public
key followed by Y's private key
(C) Encryption: X's public key followed by Y's private key; Decryption: Y's public
key followed by X's private key
(D) Encryption: X's private key followed by Y's public key; Decryption: Y's private
key followed by X's public key 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)