GATE

Set-15 TOC GATE 2006

TOC |Gate-2007| Previous Year Questions| Set-14

TOC |Gate-2007| Theory of Computation ( Automata) Which of the following problems is undecidable?  [GATE – 2007] a. Membership problem for CFGs.b. Ambiguity problem for CFGs.c. Finiteness problem for FSAs.d. Equivalence problem for FSAs. Answer : b) Which of the following is TRUE?  [GATE – 2007] a. Every subset of a regular set is regular.b. …

TOC |Gate-2007| Previous Year Questions| Set-14 Read More »

Set-15 Operating System Questions

Operating System |Gate-2006| previous year question|Set-15

Operating System |Gate-2006| Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. …

Operating System |Gate-2006| previous year question|Set-15 Read More »

Set-15 Operating System Questions

Operating System |Gate-2008| previous year question|Set-13

Operating System |Gate-2008| The data blocks of a very large file in the Unix file system are allocated using  : [GATE – 2008]  a. contiguous allocationb. linked allocationc. indexed allocationd. an extension of indexed allocation Answer : d) Which of the following statements about synchronous and asynchronous I/O is NOT true? [GATE – 2008] a. …

Operating System |Gate-2008| previous year question|Set-13 Read More »

Set-15 Operating System Questions

Operating System |Gate-2009| previous year question|Set-12

Operating System |Gate-2009| In which one of the following page replacement policies, Belady’s anomaly may occur? [GATE – 2009] a. FIFOb. Optimalc. MRUd. LRU Answer : a) The essential content(s) in each entry of a page table is / are : [GATE – 2009] a. Virtual page numberb. Page frame numberc. Both virtual page number …

Operating System |Gate-2009| previous year question|Set-12 Read More »