#1
September 14th, 2013, 08:24 PM
| |||
| |||
GATE Exam Computer Science engineering stream previous year question paper
how can i download 10 yr gate exam paper with solution for cse Yes sure, here I am sharing the GATE Exam Computer Science engineering stream previous year question paper: Q.9 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → є and A → a) to parse a string with n tokens? (A) n/2 (B) n-1 (C) 2n-1 (D) 2n 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. Remaining questions are in the attachment, download it freely from here: Last edited by Neelurk; February 28th, 2020 at 01:56 PM. |
#2
July 16th, 2014, 08:35 AM
| |||
| |||
GATE Exam Computer Science engineering stream previous year question paper
Can you provide me the GATE Exam Computer Science engineering stream previous year question paper???
|
|