#1
20th August 2014, 04:38 PM
| |||
| |||
GATE (Computer Science) Previous Papers
Here I am looking for the last year question paper of GATE (Computer Science) Exam, can you please provide me the same???
|
#2
21st August 2014, 09:17 AM
| |||
| |||
Re: GATE (Computer Science) Previous Papers
As you are looking for the last year question paper of GATE (Computer Science) Exam, so here I am sharing the same with you 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. The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are (A) TCP, UDP, UDP and TCP (B) UDP, TCP, TCP and UDP (C) UDP, TCP, UDP and TCP (D) TCP, UDP, TCP and UDP 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. ![]() ![]() ![]() ![]() ![]() Rest of the questions are attached in below file which is free of cost |
|