| 20th July 2014 08:34 AM | |
| Kiran Chandar | Re: GATE in Computer Science Solved question papers As per your request here I am sharing the GATE in Computer Science Solved question papers: Q.10 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? (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. An index is clustered, if (A) it is on a set of fields that form a candidate key. (B) it is on a set of fields that include the primary key. (C) the data records of the file are organized in the same order as the data entries of the index. (D) the data records of the file are organized not in the same order as the data entries of the index.      Rests of the questions are in the attachment, download it freely from here: |
| 17th July 2014 02:37 PM | |
| Unregistered | GATE in Computer Science Solved question papers Will you please provide me the GATE in Computer Science Solved question papers??? |
